Shortest Cut Graph of a Surface with Prescribed Vertex Set
Author:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 100-111
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Minimum cuts and shortest homologous cycles2009
- Homology flows, cohomology cuts2009
- Splitting (complicated) surfaces is hardComputational Geometry, 2008
- Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded GraphsDiscrete & Computational Geometry, 2007
- Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time2006
- Optimal System of Loops on an Orientable SurfaceDiscrete & Computational Geometry, 2005
- Optimally Cutting a Surface into a DiskDiscrete & Computational Geometry, 2004
- Computing a canonical polygonal schema of an orientable triangulated surface2001
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHSInternational Journal of Computational Geometry & Applications, 1996
- Classical Topology and Combinatorial Group Theory1993