Splitting (complicated) surfaces is hard
Authors:
- Erin W. ChambersECErin W. Chambers
- Éric Colin de VerdièreÉVÉric Colin de Verdière
- Jeff EricksonJEJeff Erickson
- Francis LazarusFLFrancis Lazarus
- Kim WhittleseyKWKim Whittlesey
- 1 October 2008
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 41 (1-2) , 94-110
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimal System of Loops on an Orientable SurfaceDiscrete & Computational Geometry, 2005
- Optimally Cutting a Surface into a DiskDiscrete & Computational Geometry, 2004
- Graphs on surfacesChoice Reviews Online, 2002
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Shortest noncrossing paths in plane graphsAlgorithmica, 1996
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHSInternational Journal of Computational Geometry & Applications, 1996
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- CLASSICAL TOPOLOGY AND COMBINATORIAL GROUP THEORY (Graduate Texts in Mathematics, 72)Bulletin of the London Mathematical Society, 1982