A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology

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...

Ausführliche Beschreibung