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

Chuzo Iwamoto Godfried T. Toussaint

Published in: Inf. Process. Lett. (1994)

Keyphrases

np complete
randomly generated
np hard
satisfiability problem
computational complexity
pspace complete
constraint satisfaction problems
conjunctive queries
query processing
phase transition
circuit design
analog circuits
finds an optimal solution