Hamiltonian Cycle
Input description: A graph G=(V,E)
Problem description: Is there an ordering of the vertices such that adjacent vertices in the ordering are connected by an edge and each vertex is visited exactly once.
Example:
Triangle strip problem.
Previous slide
Next slide
Back to first slide
View graphic version