|
gptkbp:instanceOf
|
Graph Theory Concept
|
|
gptkbp:alsoKnownAs
|
gptkb:Hamiltonian_Circuit
|
|
gptkbp:application
|
gptkb:Traveling_Salesman_Problem
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:decision
|
Does a given graph have a Hamiltonian cycle?
|
|
gptkbp:definedIn
|
A cycle in a graph that visits each vertex exactly once and returns to the starting vertex
|
|
gptkbp:exampleGraph
|
gptkb:Dodecahedron_Graph
gptkb:Icosahedron_Graph
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Hamiltonian Cycle
|
|
gptkbp:namedAfter
|
gptkb:William_Rowan_Hamilton
|
|
gptkbp:notEveryGraphHas
|
gptkb:Hamiltonian_Cycle
|
|
gptkbp:partOf
|
gptkb:Graph_Theory
Combinatorics
Theoretical Computer Science
|
|
gptkbp:relatedTo
|
gptkb:Hamiltonian_Path
gptkb:Eulerian_Cycle
|
|
gptkbp:studiedBy
|
gptkb:William_Rowan_Hamilton
|
|
gptkbp:studiedIn
|
gptkb:Discrete_Mathematics
|
|
gptkbp:usedIn
|
gptkb:Bioinformatics
Network Design
Optimization Problems
|
|
gptkbp:bfsParent
|
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
|
gptkbp:bfsLayer
|
6
|