Thread-Safe priority queues in haskell based on skiplists
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Computing single-source shortest paths is a fundamental and ubiquitous problem in network analysis. Aside from the importance of this problem in its own right, often the problem arises in the solution of other optimization problems like network flow and matching. In this thesis we consider the problem of computing shortest paths in parallel, dynamic, and sequential realms. We also consider the related problem of graph-reachability in these settings.