Faster Shortest-Path Algorithms for Planar Graphs

Journal of Computer and System Sciences

Volumn 55, Issue 1, 1997, Pages 3-23

  Henzinger, Monika R ^a   Klein, Philip ^b   Rao, Satish ^c   Subramanian, Siaram ^c  

^a School of Operations Research and Information Engineering   (United States)

^b Brown Univerity   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER APPLICATIONS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY;

NONNEGATIVE EDGE-LENGTHS; PLANAR GRAPHS;

ALGORITHMS;

EID: 0031212053     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1493     Document Type: Article

References (28)

1. [AMO] R. Ahuja, K. Mehlhorn, J. Orlin, and R. E. Tarjan, Faster algorithms for the shortest path problem, J. Assoc. Comput. Mach. 37 (1990), 213-223.
2. [AST] N. Alon, P. Seymour, and R. Thomas, A separator theorem for nonplanar graphs, J. Amer. Math. Soc. 3 (1990), 801-808.
3. [Coh] E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, in "Proceedings, 5th Annual Symposium on Parallel Algorithms and Architectures, 1993."
4. [Fre1] G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput. 14 (1985), 781-798.
5. [Fre2] G. N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput. 16 (1987), 1004-1022.
6. [Fre3] G. N. Frederickson, An optimal algorithm for selection in a min-heap, Inform, and Comput. 104 (1993), 197-214.
7. [FrW] M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, in "Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, 1990."
8. [FrT] M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. Comput. Mach. 34 (1987), 596-615.
9. [GaT] H. N. Gabow and R. E. Tarjan, Almost-optimum speed-ups of algorithms for bipartite matching and related problems, in "Proc. 20th Annual ACM Symposium on Theory of Computing, 1988."
10. [GaI] Z. Galil and G. F. Italiano, Maintaining biconnected components of dynamic planar graph, in "Proc. 18th Int. Colloquium on Automata, Languages, and Programming, 1991."
11. [GIS] Z. Galil, G. F. Italiano, and N. Sarnak, Fully dynamic planarity testing, in "Proc. 24th Annual ACM Symposium on Theory of Computing, 1992."
12. [GaM] H. Gazit and G. L. Miller, A parallel algorithm for finding a separator in planar graphs, "Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, 1987."
13. [GHT] J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan, A separator theorem for graphs of bounded genus, J. Algorithms 5 (1984), 391-407.
14. [Go1] A. V. Goldberg, "Scaling Algorithms for the Shortest Path Problem," SIAM J. Comput. 24 (1995), 494-504.
15. [Goo] M. Goodrich, Planar separators and parallel polygon triangulation, J. Comput. System Sci. 51 (1995), 374-389.
16. [Has] R. Hassin, Maximum flow in (s, t) planar networks, Inform. Process. Lett. 13 (1981), 107.
17. 2 n) algorithm for maximum flow in undirected planar networks, SIAM J Comput. 14 (1985), 612-624.
18. [Joh] D. B. Johnson, Parallel algorithms for minimum cuts and maximum flows in planar networks, J. Assoc. Comput. Mach. 34 (1987), 950-967.
19. 1.5 log n) time, in "Proc. 20th Annual Allerton Conf. on Communication, Control, and Computing, 1982."
20. [KPS] P. Klein, S. Plotkin, C. Stein, and E. Tardos, Faster approximation algorithms for the unit capacity concurrent-flow problem with applications to routing and finding sparse cuts, SIAM J. Comput. 23 (1994), 466-487.
21. [KlS] P. N. Klein and S. Subramanian, A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs, in "Proc. 1993 Workshop on Algorithms and Data Structures, 1993."
22. [LRT] R. Lipton, D. Rose, and R. E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal. 16 (1979), 346-358.
23. [LiT] R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177-189.
24. [MiN] G. L. Miller and J. Naor, Flows in planar graphs with multiple sources and sinks, SIAM J. Comput. 24 (1995).
25. [MTV] G. L. Miller, S. Teng, and S. Vavasis, A unified geometric approach to graph separators, in "Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, 1990."
26. [PST] S. A. Plotkin, D. B. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, in "Proceedings 32nd IEEE Symposium on Foundations of Computer Science, 1991."
27. [Sub] S. Subramanian, A Fully Dynamic Data Structure for Reachability in Planar Digraphs, in "Proc. 1993 European Symposium on Algorithms, 1993."
28. [Tho] M. Thorup, On RAM priority queues, in "Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996."