Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:appearsIn |
graph theory
|
| gptkbp:application |
gptkb:traveling_salesman_problem
bioinformatics |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
a path in a graph that visits each vertex exactly once
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:hasProperty |
may or may not exist in a given graph
not necessarily a cycle visits every vertex exactly once |
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian path
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
gptkb:Eulerian_path |
| gptkbp:studiedBy |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsParent |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsLayer |
4
|