(thing) by flyingroc Fri Nov 10 2000 at 19:12:33
The Hamiltonian cycle problem is: given a graph, is there a simple cycle, where every vertex is visited exactly once?

This problem has been proven to be NP-complete for both directed and undirected graphs by a reduction from vertex cover. Related problems are Hamiltonian Path and the Traveling Salesman problem.

del.icio.us Facebook Digg StumbleUpon Reddit (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.