Computing the shortest essential cycle

Discrete and Computational Geometry

Volumn 44, Issue 4, 2010, Pages 912-930

  Erickson, Jeff ^a   Worah, Pratik ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Combinatorial surface; Computational topology; Essential cycles; Topological graph theory

Indexed keywords

EID: 77957994746     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-010-9241-8     Document Type: Article

References (36)

1. Berger, M.: A Panoramic View of Riemannian Geometry. Springer, Berlin (2003).
2. Borradaile, G., Lee, J. R., Sidiropoulos, A.: Randomly removing g handles at once. In: Proc. 25th Ann. Symp. Comput. Geom., pp. 371-376 (2009).
3. Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, New York (1990).
4. Cabello, S.: Many distances in planar graphs. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 1213-1220 (2006).
5. Cabello, S., Chambers, E.W.: Multiple source shortest paths in a genus g graph. In: Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 89-97 (2007).
6. Cabello, S., Mohar, B.: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Discrete Comput. Geom. 37, 213-235 (2007).
7. Cabello, S., DeVos, M., Erickson, J., Mohar, B.: Finding one tight cycle. In: Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 527-531 (2008).
8. Chambers, E.W., Colin de Verdière, É., Erickson, J., Lazarus, F., Whittlesey, K.: Splitting (complicated) surfaces is hard. Comput. Geom. Theory Appl. 41(1-2), 94-110 (2008).
9. Chambers, E. W., Erickson, J., Nayyeri, A.: Minimum cuts and shortest homologous cycles. In: Proc. 25th Ann. ACM Symp. Comput. Geom., pp. 377-385 (2009).
10. Colin de Verdière, É.: Shortening of curves and decomposition of surfaces. Ph. D. thesis, Université Paris 7, December 2003 (http://www. di. ens. fr/users/colin/textes/these. html. en).
11. Colin de Verdière, É.: Personal communication (2004).
12. Colin de Verdière, É., Erickson, J.: Tightening non-simple paths and cycles on surfaces. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 192-201 (2006).
13. Colin de Verdière, É., Lazarus, F.: Optimal pants decompositions and shortest homotopic cycles on an orientable surface. J. ACM 54(4) (2007).
14. Demaine, E. D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. In: Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 278-287 (2007).
15. Dijkstra, E. W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269-271 (1959).
16. Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 599-608 (2004).
17. Eppstein, D.: Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. In: Proc. 18th ACM-SIAM Symp. Discrete Algorithms, pp. 29-38 (2007).
18. Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1), 37-59 (2004).
19. Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 1038-1046 (2005).
20. Farb, B., Margalit, D.: A primer on mapping class groups. Preprint, Version 3. 1, June 1 (2009) (http://www. math. utah. edu/~margalit/primer/).
21. Guskov, I., Wood, Z.: Topological noise removal. In: Proc. Graph. Interface, pp. 19-26 (2001).
22. Harary, F., Nieminen, J.: Convexity in graphs. J. Differ. Geom. 16(2), 185-190 (1981).
23. Harer, J. L., Penner, R. C.: Combinatorics of Train Tracks. Annals of Math. Studies, vol. 125. Princeton University Press, Princeton (1992).
24. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2001).
25. Henzinger, M. R., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3-23 (1997).
26. Indyk, P., Sidiropoulos, A.: Probabilistic embeddings of bounded genus graphs into planar graphs. In: Proc. 23rd Ann. ACM Symp. Comput. Geom., pp. 204-209 (2007).
27. Kawarabayashi, K., Mohar, B.: Graph and map isomorphism and all polyhedral embeddings in linear time. In: Proc. 40th Ann. ACM Symp. Theory Comput., pp. 471-480 (2008).
28. Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: Proc. 39th Ann. ACM Symp. Theory Comput., pp. 382-390 (2007).
29. Kutz, M.: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. In: Proc. 22nd Ann. ACM Symp. Comput. Geom., pp. 430-438 (2006).
30. Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proc. 17th Ann. ACM Symp. Comput. Geom., pp. 80-89 (2001).
31. Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Press, Baltimore (2001).
32. Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica 7, 105-113 (1987).
33. Poon, S.-H., Thite, S.: Pants decomposition of the punctured plane. In: Proc. 22nd European Workshop Comput. Geom., pp. 99-102 (2006). arXiv: cs. CG/0602080.
34. Seppälä, M., Sorvali, T.: Geometry of Riemann Surfaces and Teichmüller Spaces. North-Holland Mathematics Studies, vol. 169. North-Holland, Amsterdam (1992).
35. Thomassen, C.: Embeddings of graphs with no short noncontractible cycles. J. Comb. Theory Ser. B 48(2), 155-177 (1990).
36. Zomorodian, A.: Topology and Computing. Cambridge University Press, Cambridge (2005).