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

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 86; číslo 9; s. 3027 - 3053
Hlavný autor:	Eppstein, David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!