Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 430-438

  Kutz, Martin ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational topology; Efficient algorithm; Non trivial cycles; Planar graph; System of loops; Universal cover

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; TOPOLOGY;

COMPUTATIONAL TOPOLOGY; EFFICIENT ALGORITHMS; NON-TRIVIAL CYCLES; PLANAR GRAPHS; SYSTEM OF LOOPS; UNIVERSAL COVER;

COMPUTATIONAL GEOMETRY;

EID: 33748180146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137919     Document Type: Conference Paper

References (16)

1. Glen E. Bredon. Topology and Geometry. Springer, 1993.
2. Sergio Cabello and Bojan Mohar. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. In Proceedings 13th European Symp. Algorithms, pages 131-142, 2005. Full version at http://www.fmf.uni-lj.si/~cabello/publications/.
3. Erin Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, and Kim Whittlesey. Splitting (complicated) surfaces is hard. In Proc. 22nd ACM Symp. Computational Geometry, 2006.
4. Éric Colin de Verdière. Shortening of Curves and Decomposition of Surfaces, PhD thesis, Université Paris 7, 2003. available from http://www.di.ens.fr/~colin/.
5. Éric Colin de Verdière and Jeff Erickson. Tightening non-simple paths and cycles on surfaces. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 192-201, 2006.
6. Éric Colin de Verdière and Francis Lazarus. Optimal system of loops on an orientable surface. In 43rd Symp. Foundations Computer Science, pages 627-636, 2002.
7. Éric Colin de Verdière and Francis Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. In Proc. 11th Symp. Graph Drawing, pages 478-490, 2003.
8. David Eppstein. Dynamic generators of topologically embedded graphs. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 599-608, 2003.
9. Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. In Proc. 18th ACM Symp. Computational Geometry, pages 244-253, 2002.
10. Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37-59, 2004.
11. Jeff Erickson and Kim Whittlesey. Greedy optimal homotopy and homology generators. In Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pages 1038-1046, 2005.
12. Greg N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Computing, 16(6):1004-1022, 1987.
13. Allen Hatcher. Algebraic Topology. Cambridge University Press, 2002. available online from http://www.math.crnell.edu/~hatcher/.
14. Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, 1997.
15. Bojan Mohar and Garsten Thomassen. Graphs on Surfaces. John Hopkins University Press, 2001.
16. 2 (n)) time. SIAM J. Computing, 12(1):71-81, 1983.