Hamiltonian Path

(thing) by flyingroc Fri Nov 10 2000 at 19:16:53
The Hamiltonian path problem is: Given a graph, is there a simple open path that contains all the vertices?

The Hamiltonian path problem has been proven to be NP-complete for both directed and undirected graphs through a reduction from vertex cover.

del.icio.us Furl 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.