Multiple-source shortest paths in planar graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 146-155

  Klein, Philip N ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DENSE DISTANCE GRAPHS; PLANAR GRAPHS; PLANAR SEPARATOR THEOREM; POINT-TO-POINT DISTANCE QUERIES;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; DATA STRUCTURES; MATHEMATICAL MODELS; QUERY LANGUAGES; THEOREM PROVING;

GRAPH THEORY;

EID: 20744452901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Alstrup, J. Holm, K. de Lichtenberg, M. Thorup, "Maintaining information in fully-dynamic trees with top trees," ArXiv cs.DS/0310065.
2. J. R. Driscoll, N. Sarnak, D. D. Sleator, R. E. Tarjan, "Making data structures persistent," JCSS 38 (1989), pp. 86-124.
3. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, "Maintenance of a minimum spanning forest in a dynamic plane graph," J. Alg. 13 (1992), pp. 33-54.
4. J. Fakcharoenphol and S. Rao, "Planar graphs, negative weight edges, shortest paths, near linear time," FOCS (2001), pp. 232-241.
5. G. N. Frederickson, "Fast algorithms for shortest paths in planar graphs, with applications," SIAM J. Comput. 16(1987), pp. 1004-1022.
6. G. N. Frederickson, "Planar graph decomposition and all pairs shortest paths, J. ACM 38 (1991), pp. 162-204.
7. G. N. Frederickson, "Using cellular graph embeddings in solving all pairs shortest paths problems," J. Algor. 19 (1995), pp. 45-85.
8. G. N. Frederickson, "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees, SIAM J. Comput 26 (1997), pp. 484-538.
9. R. Hassin, "Maximum flows in (s, t) planar networks," Inform. Process. Lett. 13 (1981), pp. 107.
10. S. Khuller, J. Naor and P. N. Klein, "The lattice structure of flow in planar graphs," SIAM J. Disc. Math. 6 (3) pp. 477-490, (1993).
11. R. J. Lipton and R. E. Tarjan, "A separator theorem for planar graphs," SIAM J. Appl. Math. 36 (1979), pp. 177-189.
12. K. Mehlhorn, S. Näher, "Bounded ordered dictionaries in O(log log N) time and O(n) space," IPL 35 (1990), pp. 183-189.
13. G. L. Miller, "Finding small simple cycle separators for 2-connected planar graphs," J. Comput. Syst. Sci. 32 (1986), pp. 265-279.
14. H. Ripphausen-Lipa, D. Wagner, and K. Weihe, "The vertex-disjoint menger problem in planar graphs," SIAM J. Comput. 26 (1997), pp. 331-349.
15. J. P. Schmidt, "All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings," SIAM J. Comput. 27 (1998), pp. 972-992.
16. D. D. Sleator and R. E. Tarjan, "A data structure for dynamic trees," J. Comput. System Sci. 26 (1983), pp. 362-391
17. M. Thorup, "Compact oracles for reachability and approximate distances in planar digraphs. FOCS (2001), pp. 242-251
18. P. van Emde Boas, "Preserving order in a forest in less than logarithmic time and linear space," IPL 6 (1977), pp. 80-82.
19. K. Weihe, "Maximum (s, t)-flows in planar networks in O(|V|log|V|) time," JCSS 55 (1997), pp. 454-476