y
Download:
|
|
by S. Banerjee, R. K. Ghosh, A. P. K. Reddy
http://www.cs.buffalo.edu/~aduri/papers/short.ps
Add To MetaCart
Abstract:
Parallel algorithm for shortest pairs of edge-disjoint paths
Citations
| 658 | A Note on Two Problems in Connexion with Graphs. Numerische Mathematik – Dijkstra - 1959 |
| 410 | Fibonacci heaps and their uses in improved network optimization algorithms – Fredman, Tarjan - 1987 |
| 39 | A priority queue in which initialization and queue operations take O(log log D) time – Johnson - 1982 |
| 22 | On lowest common ancestors: Simpli and parallelization – Schieber, Vishkin - 1988 |
| 18 | Network Theory, algorithms, and applications – Ahuja, Magnanti, et al. - 1993 |
| 8 | Efficient parallel algorithms for a class of graph theoretic problems – Tsin, Chin - 1984 |
| 5 | Faster optimal parallel pre x sums and list ranking – Cole, Vishkin - 1989 |
| 4 | D.G.Kirkpatrick and T.Przytycka, A simple parallel tree contraction algorithm – Abrahamson, Dadoun - 1989 |
| 3 | Tarzan, \A quick method for the shortest pair of disjoint paths – Suurballe, E - 1984 |
| 1 | Orlin and R.E.Tarjan, Faster algorithms for the shortest path problem,Journal of – Ahuja, Mehlhorn |
| 1 | Parallel algorithm for shortest paths – Ghosh, Bhattacharjee |
