Tightening non-simple paths and cycles on surfaces
From MaRDI portal
Publication:3581530
DOI10.1145/1109557.1109580zbMath1192.68737OpenAlexW4241627814MaRDI QIDQ3581530
Éric Colin de Verdière, Jeff Erickson
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109580
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Minimum Cuts in Surface Graphs ⋮ Computing the shortest essential cycle ⋮ Non total-unimodularity neutralized simplicial complexes ⋮ The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing ⋮ Splitting (complicated) surfaces is hard ⋮ New results on planar and directed multicuts
This page was built for publication: Tightening non-simple paths and cycles on surfaces