Multiple source shortest paths in a genus g graph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 89-97

  Cabello, Sergio ^a   Chambers, Erin W ^b  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; ITERATIVE METHODS; TREES (MATHEMATICS);

KINETIC DATA STRUCTURE; MULTIPLE SOURCE; NON-SEPARATING CYCLES; ORIENTABLE; SHORTEST PATH; SHORTEST PATH TREE;

GRAPH THEORY;

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

References (17)

1. S. Cabello and B. Mohar. Finding shortest nonseparating and non-contractible cycles for topologically embedded graphs. In G. S. Brodal and S Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, volume 3669 of LNCS, pages 131-142. Springer, 2005.
2. E. W. Chambers, É. Colin de Verdìere, J. Erickson, F. Lazarus, and K. Whittlesey. Splitting (complicated) surfaces is hard. In SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pages 421-429, New York, NY, USA, 2006. ACM Press.
3. É. Colin de Verdìere and J. Erickson. Tightening non-simple paths and cycles on surfaces. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 192-201, New York, NY, USA, 2006. ACM Press.
4. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. In STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 109-121, New York, NY, USA, 1986. ACM Press.
5. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete and Comput. Geometry, 31(1):37-59, 2004.
6. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput., 16(6):1004-1022, 1987.
7. L. Guibas. Kinetic data structures: A state of the art report, 1998.
8. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4):502-516, 1999.
9. P. N. Klein. Multiple-source shortest paths in planar graphs. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 146-155, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
10. M. Kutz. Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. In SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pages 430-438, New York, NY, USA, 2006. ACM Press.
11. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
12. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-114, 1987.
13. J. P. Schmidt. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM J. Comput., 27(4):972-992, 1998.
14. J. Stillwell. Classical Topology and Combinatorial Group Theory. Springer-Verlag, New York, 1993.
15. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983.
16. R. E. Tarjan and R. F. Werneck. Self-adjusting top trees. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 813-822, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
17. A. Zomorodian. Topology for Computing. Cambridge University Press, 2005.