A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
arXiv:1010.6200 · doi:10.1007/s00453-012-9645-3
Abstract
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double description method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double description method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation. Experimental comparisons of running times are included.
arXiv comment28 pages, 7 figures; v2: minor revisions; to appear in Algorithmica
References in corpus (5)
- Notes on Perelman's papers
- The complexity of the normal surface solution space
- Optimizing the double description method for normal surface enumeration
- Converting between quadrilateral and standard solution sets in normal surface theory
- Maximal admissible faces and asymptotic bounds for the normal surface solution space