Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can l...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 86; H. 9; S. 3027 - 3053
1. Verfasser:	Eppstein, David
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2024 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Convexity Data Structures and Information Theory Mathematics of Computing Polynomials Theory of Computation Output-sensitive enumeration Non-crossing Hamiltonian path Polygonalization Approximate counting
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!