Faster shortest-path algorithms for planar graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 27-37

  Klein, Philip ^a   Rao, Satish ^b   Rauch, Monika ^c   Subramanian, Sairam ^a  

^a BROWN UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; DIRECTED GRAPHS; FLOW GRAPHS; GRAPHIC METHODS; COMPUTER NETWORKS; CRITICAL PATH ANALYSIS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; MATHEMATICAL MODELS;

ABSOLUTE VALUES; BIPARTITE GRAPHS; LINEAR-TIME ALGORITHMS; PERFECT MATCHINGS; SHORTEST PATH ALGORITHMS; SINGLE SOURCE SHORTEST PATHS; SOURCE AND SINK; TIME ALGORITHMS;

GRAPH THEORY; ALGORITHMS;

PLANAR GRAPHS; SHORTEST PATH ALGORITHMS; SINGLE SOURCE SHORTEST PATHS;

EID: 0027961552     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195092     Document Type: Conference Paper

References (27)

1. R. Ahuja, K. Mehlhorn, J. Orlin, and R. E. Tarjan, "Faster algorithms for the shortest path problem, " Journal of the Association for Computing Machinery 37(1990), 213-223.
2. N. Alon, P. Seymour, and R. Thomas, "A separator theorem for graphs with an excluded minor and its applications, " Proc. 22nd Annual ACM Symposium on Theory of Computing (1990), 293-299.
3. M.J. Atallah, R. Cole, and M.T. Goodrich, "Cascading Divide-And Conquer: A Technique for Designing Parallel Algorithms, " Proc. 28th IEEE Symp. on Foundations of Computer Science (1987), 151-160.
4. E. Cohen, "Efficient parallel shortest-paths in digraphs with a separator decomposition, " Pioc. 5th Annual Symposium on Parallel Algorithms and Architectures (1993), 57-67.
5. E. Cohen, "Parallel algorithms with improved work for shortest-paths from multiple sources, " Proc. 2nd Israel Symposium on Theory of Computing and Systems ( 1993), 57-67.
6. G.N. Frederickson, "Data Structures for On-Line Updating of Minimum Spanning Trees, " Proc. 15th ACM Symp. on Theory of Computing (1983), 252-257.
7. G.N. Frederickson, "Fast algorithms for shortest paths in planar graphs, with applications, " SIAM Journal on Computing 16 (1987), 1004-1022.
8. M. L. Fredman and D. E. Willard, "Trans- dichotomous algorithms for minimum spanning trees and shortest paths, " Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (1990), 719-725.
9. M.L. Fredman and R.E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms, " Journal of the Association for Computing Machinery 34(1987), 596-615.
10. Z. Galil and G. F. Italiano, "Maintaining biconnected components of dynamic planar graphs, " Proc. 18th Int. Colloquium on Automata, Languages, and Programming. (1991), 339-350.
11. Z. Galil, G.F. Italiano, and N. Sarnak, "Fully Dynamic Planarity Testing, " Proc. 24th Annual ACM Symposium on Theory of Computing (1992), 495-506.
12. 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), 238-248.
13. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan, "A separation theorem for graphs of bounded genus, " Journal of Algorithms, 1984.
14. A.V. Goldberg, "Scaling Algorithms for the Shortest Path Problem, " SIAM Symposium on Discrete Algorithms. (1993).
15. M. Goodrich, "Planar Separators and Parallel Polygon Triangulation, " Proc. 24th Annual ACM Symposium on Theory of Computing (1992), 507-516.
16. T. H. Cormen, C. E. Leiserson, and R. E. Rivest, Introduction to Algorithms, MIT Press, 1990.
17. R. Hassin, "Maximum flow in (s, t) planar networks, " Information Processing Letters 13 (1981), 107.
18. D.B. Johnson, "Parallel algorithms for minimum cuts and maximum flows in planar networks, " Journal of the Association for Computing Machinery 34 (1987), 950-967.
19. D.B. Johnson and S.M. Venkatesan, "Using divide and conquer to find flows in directed planar networks in 0(n15 log n) time, " Proc. 20th Annual Allerton Conf. on Communication, Control, and Computing (1982), 898-905.
20. P. N. Klein and S. Subramanian, "A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs, " Proc. 1993 Workshop on Algorithms and Data Structures (1993), 442-451.
21. G. L. Miller and J. Naor, "Flows in planar graphs with multiple sources and sinks, " Proc. 30th IEEE Symposium on Foundations of Computer Science (1989), 112-117.
22. G. L. Miller, S. Teng, and S. Vavasis, "A unified geometric approach to graph separators, " Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (1991), 538-547.
23. R.J. Lipton and R.E. Tarjan, "A separator theorem for planar graphs, " SIAM Journal of Applied Mathematics 36 (1979), 177-189.
24. H. N. Gabow and R. E. Tarjan, "Almost-optimum speed-ups of algorithms for bipartite matching and related problems, " Proc. 20th Annual ACM Sym- posim on Theory of Computing (1988), 514-527.
25. V. Pan and J. H. Reif, "Fast and efficient solution of path algebra problems, " Journal of Computer and System Sciences 38 (1989), 494-510.
26. V. Pan and J. H. Reif, "The parallel computation of minimum cost paths in graphs by stream contraction, " Information Processing Letters 40 (1991), 79-83.
27. S. Subramanian, "A Fully Dynamic Data Structure For Reachability in Planar Digraphs, " Proc. 1993 European Symposium on Algorithms (1993).