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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 65; no. 4; pp. 772 - 801
Main Authors:	Burton, Benjamin A., Ozlen, Melih
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.04.2013
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Backtracking 52B55 Normal surfaces Vertex enumeration Linear programming 90C05 57N35 57N10 Tree traversal
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!