Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
theoretical computer science |
| gptkbp:category |
theoretical computer science
combinatorial problem |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a graph, determine whether there exists a cycle that visits each vertex exactly once.
|
| gptkbp:describedBy |
graph theory
|
| gptkbp:difficulty |
NP-complete
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:formedBy |
gptkb:William_Rowan_Hamilton
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian cycle problem
|
| gptkbp:input |
graph
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:output |
yes or no
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
gptkb:Hamiltonian_path_problem gptkb:Traveling_salesman_problem |
| gptkbp:solvedBy |
dynamic programming
backtracking brute force |
| gptkbp:bfsParent |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsLayer |
4
|