Polylog-time and near-linear work approximation scheme for undirected shortest paths
Journal of the ACM (JACM)
Buckets Strike Back: Improved Parallel Shortest Paths
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
| Hi-index | 0.00 |