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:	arXiv.org
Hlavný autor:	Eppstein, David
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 01.03.2023
Predmet:	Algorithms Computational geometry Convexity Polynomials
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!