|
11
|
Parallel Shortest Path for Arbitrary Graphs
– U. Meyer, P. Sanders
- 2000
|
|
17
|
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
– Jesper L. Träff, Christos D. Zaroliagis
- 1996
|
|
1011
|
A Note on Two Problems in Connexion with Graphs
– E. W. Dijkstra
- 1959
|
|
73
|
Undirected single-source shortest paths with positive integer weights in linear time
– M Thorup
- 1999
|
|
8
|
Efficient sequential and parallel algorithms for the negative cycle problem
– P Spirakis D Kavvadias, G Pantziou, C Zaroliagis
- 1994
|
|
13
|
Shortest path queries in digraphs of small treewidth
– S Chaudhuri, C D Zaroliagis
- 1995
|
|
252
|
On a routing problem
– R Bellman
- 1958
|
|
28
|
Efficient parallel shortest-paths in digraphs with a separator decomposition
– Edith Cohen
- 1996
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
14
|
A Parallel Priority Queue with Constant Time Operations
– Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
- 1998
|
|
595
|
An introduction to parallel algorithms
– J Jájá
- 1992
|
|
13
|
A randomized parallel algorithm for single-source shortest paths
– Philip N. Klein, Sairam Subramanian
- 1997
|
|
23
|
Recent results on the single-source shortest paths problem
– R Raman
- 1997
|
|
69
|
On RAM priority queues
– Mikkel Thorup
- 1996
|
|
24
|
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
– Ulrich Meyer
- 2001
|
|
8
|
Performance Study of a Parallel Shortest Path Algorithm
– Michelle Hribar, Valerie E. Taylor, David E. Boyce
- 1996
|
|
19
|
On finding and updating shortest paths distributively
– K V S Ramarao, S Venkatesan
- 1992
|
|
21
|
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs
– Yijie Han, V. Y. Pan, J. H. Reif
- 1997
|
|
9
|
Δ-stepping: a parallelizable shortest path algorithm
– U Meyer, P Sanders
- 2003
|
