Undirected Hamiltonian Cycle
GPTKB entity
Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:contrastsWith |
gptkb:Directed_Hamiltonian_Cycle
|
| gptkbp:definedIn |
A cycle in an undirected graph that visits each vertex exactly once and returns to the starting vertex
|
| gptkbp:hasDecisionProblem |
Does a given undirected graph contain a Hamiltonian cycle?
|
| https://www.w3.org/2000/01/rdf-schema#label |
Undirected Hamiltonian Cycle
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_Cycle
gptkb:Traveling_Salesman_Problem gptkb:Undirected_Graph NP-complete Problem |
| gptkbp:usedIn |
gptkb:Combinatorial_Optimization
Theoretical Computer Science |
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|