Many distances in planar graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1213-1220

  Cabello, Sergio ^a  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DISTANCE MEASUREMENT;

BOUNDED-GENUS SURFACE; NEGATIVE EDGE-LENGTHS; NON-CONTRACTIBLE CYCLES; PLANAR GRAPH;

GRAPH THEORY;

EID: 33244468605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109691     Document Type: Conference Paper

References (21)

1. S. Arikati, D. Chen, L. Chew, G. Das, M. Smid, and C. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In ES A'96, volume 1136 of LNCS, pages 514-528. Springer, 1996.
2. S. Cabello and B. Mohar. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. In ESA '05, volume 3669 of LNCS, pages 131-142. Springer, 2005.
3. 3/ log n) time. In WADS '05, volume 3608 of LNCS, pages 318-324. Springer, 2005.
4. D. Chen and J. Xu. Shortest path queries in planar graphs. In STOC'00 pages 469-478, 2000.
5. H. Djidjev. Efficient algorithms for shortest path problems on planar digraphs. In WG'96, volume 1197 of LNCS, pages 151-165. Springer, 1997.
6. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 9, pages 425-461. Elsevier, 2000.
7. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom., 31(1):37-59, 2004.
8. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. Available from the authors' webpages. Preliminary version in FOCS'01.
9. G. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput., 16:1004-1022, 1987.
10. G. Frederickson. Planar graph decomposition and all pairs shortest paths. J. ACM, 38(1): 162-204, 1991.
11. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric spanners. Technical Report TR-04-08, School of Computer Science, Carleton University, 2004.
12. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001. Available at http://www.math.Cornell.edu/~hatcher/.
13. M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, 1997.
14. P. N. Klein. Multiple-source shortest paths in planar graphs. In SODA '05, pages 146-155, 2005.
15. L. Kowalik and M. Kurowski. Short path queries in planar graphs in constant time. In STOC'03, pages 143-148, 2003.
16. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
17. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci., 32:265-279, 1986.
18. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, Baltimore, 2001.
19. G. Narasimhan and M. Smid. Approximating the stretch factor of euclidean graphs. SIAM Journal on Computing, 30:978-989, 2000.
20. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. J. ACM, 51(6):993-1024, 2004.
21. U. Zwick. Exact and Approximate Distances in Graphs - A Survey. In ESA 2001, volume 2161 of LNCS, pages 33-48. Springer, 2001.