Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:application |
gptkb:Traveling_Salesman_Problem
Genome Assembly |
| gptkbp:complexity |
NP-complete
|
| gptkbp:contrastsWith |
gptkb:Directed_Hamiltonian_Path
|
| gptkbp:defines |
A path in an undirected graph that visits each vertex exactly once
|
| gptkbp:hasProperty |
Does not repeat vertices
Edges are undirected Visits all vertices exactly once |
| https://www.w3.org/2000/01/rdf-schema#label |
Undirected Hamiltonian Path
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_Cycle
gptkb:Hamiltonian_Path gptkb:Undirected_Graph |
| gptkbp:studiedBy |
19th Century
|
| gptkbp:studiedIn |
Combinatorics
Theoretical Computer Science |
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|