Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete.

Chuzo Iwamoto Godfried T. Toussaint

Published in: CCCG (1994)

Keyphrases

np complete
randomly generated
np hard
constraint satisfaction problems
satisfiability problem
computational complexity
polynomial time complexity
high speed
endpoints
special case
digital curves
circuit design
delay insensitive
tunnel diode