Hamiltonian Path

created by flyingroc

(thing) by flyingroc (1.2 y) (print) ? (I like it!) 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.

How to tell whether a figure can be drawn in one stroke	NP-complete	vertex cover	Hamiltonian cycle
Eulerian graph	Hamiltonian circuit	DNA Computing	algorithm
Hamiltonian	Independent set	NP	DNA
Gray code

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.

Login
Password

Ctrl Y
cognitive dissonance	(fiction)
SharQ
Gone Baby Gone	(review)
halfWit
If I could, I'd title this "Freedom"	(thing)
Roninspoon
Airline Hero	(thing)
Ktistec
Why Women Are Always Cold	(person)
doctor wilson
Drug policy reform	(thing)
tejasa
Easy Raspberry Cheesecake	(recipe)
Joysim
Drug policy reform	(idea)
aneurin
Tyburn	(place)
niruena
Boiling to death	(idea)
artman2003
summer	(thing)
doctor wilson
The Silver City and the Silent Sea	(log)
Dreamvirus
The Silver City and the Silent Sea	(poetry)
Aerobe
A nihilist's soulmate	(poetry)
BookReader
Soup, of the green variety	(recipe)

Everything 2 is brought to you by the letter C and The Everything Development Company