Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:alsoKnownAs |
Directed Hamiltonian circuit
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
A directed cycle that visits each vertex of a directed graph exactly once
|
| gptkbp:generalizes |
Hamiltonian path in directed graphs
|
| gptkbp:hasDecisionProblem |
Does a given directed graph have a directed Hamiltonian cycle?
|
| https://www.w3.org/2000/01/rdf-schema#label |
Directed Hamiltonian Cycle
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
NP-complete problem Directed graph |
| gptkbp:studiedIn |
gptkb:Theoretical_computer_science
Combinatorics |
| gptkbp:usedIn |
Traveling salesman problem (TSP)
|
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|