Finding shortest non-separating and non-contractible cycles for topologically embedded graphs

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 131-142

  Cabello, Sergio ^a   Mohar, Bojan ^b  

^a Physics and Mechanics   (Slovenia)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY;

EMBEDDED GRAPHS; NON-SEPARATING CYCLES;

TOPOLOGY;

EID: 27144444058     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_14     Document Type: Conference Paper

References (21)

1. M. O. Albertson and J. P. Hutchinson. On the independence ratio of a graph. J. Graph Theory, 2:1-8, 1978.
2. T. K. Dey and S. Guha. Transforming curves on surfaces. J. Comput. Syst. Sci., 58:297-325, 1999. Preliminary version in FOCS'95.
3. T. K. Dey and H. Schipper. A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection. Discrete Comput. Geom., 14:93-110, 1995.
4. H. Djidjev. On-line algorithms for shortest path problems on planar digraphs. In WG'96, volume 1197 of LNCS, pages 151-165, 1997.
5. É. Colin de Verdière. Shortening of curves and decomposition of surfaces. PhD thesis, University Paris 7, December 2003.
6. É. Colin de Verdière and F. Lazarus. Optimal system of loops on an orientable surface. In FOCS 2002, pages 627-636, 2002. To appear in Discrete Comput. Geom.
7. É. Colin de Verdière and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. In GD 2003, volume 2912 of LNCS, 2004.
8. D. Eppstein. Dynamic generators of topologically embedded graphs. In SODA 2003, pages 599-608, 2003.
9. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom., 31:37-59, 2004. Preliminary version in SoCG'02.
10. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In SODA 2005, 2005.
11. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. In FOCS 2001, pages 232-242, 2001.
12. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, 1987. Preliminary version in FOCS'84.
13. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001.
14. M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, 1997.
15. P. N. Klein. Multiple-source shortest paths in planar graphs. In SODA 2005, 2005.
16. F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. In SOCG 2001, pages 80-89, 2001.
17. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, Baltimore, 2001.
18. A. Schrijver. Disjoint circuits of prescribed homotopies in a graph on a compact surface. J. Combin. Theory Ser. B, 51:127-159, 1991.
19. A. Schrijver. Paths in graphs and curves on surfaces. In First European Congress of Mathematics, Vol. II, volume 120 of Progr. Math., pages 381-406. Birkhäuser, 1994.
20. C. Thomassen. Embeddings of graphs with no short noncontractible cycles. J. Combin. Theory, Ser. B, 48:155-177, 1990.
21. G. Vegter and C. K. Yap. Computational complexity of combinatorial surfaces. In SOCG 1990, pages 102-111, 1990.