"Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete."

Michael B. Dillencourt (1996)

Details and statistics

DOI: 10.1016/0166-218X(94)00125-W

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics