Problem Statement: Devise an algorithm that provides all possible paths from source to destination with total edge latency within a given budget b, whose nodes are all on some simple path from source to destination. These dissemination graphs allow us to get an upper bound on reliability for a given source, destination, and time budget. We can find a lower bound on cost and the corresponding reliability by determining the graph with the smallest budget for which any path exists for a given graph, source, and destination.
Details of our algorithm and example runs can be found in the presentation here (pdf). A GUI that runs the algorithm on a text representation of an arbitrary symmetric weighted graph, for a given source, destination, and budget can be found here (also available on GitHub here).