Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alsoKnownAs |
gptkb:Hamiltonian_circuit
|
| gptkbp:appearsIn |
gptkb:Icosian_game
|
| gptkbp:application |
gptkb:traveling_salesman_problem
robotics bioinformatics circuit design |
| gptkbp:category |
gptkb:cycle_(graph_theory)
NP-complete problems |
| gptkbp:definedIn |
a cycle in a graph that visits each vertex exactly once and returns to the starting vertex
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian cycle
|
| gptkbp:isNPComplete |
true
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path
gptkb:Eulerian_cycle |
| gptkbp:studiedBy |
gptkb:William_Rowan_Hamilton
|
| gptkbp:studiedIn |
discrete mathematics
theoretical computer science |
| gptkbp:supportsAlgorithm |
dynamic programming
backtracking heuristic algorithms |
| gptkbp:bfsParent |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsLayer |
4
|