Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:decision |
yes
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:hasSpecialCase |
path problems in graphs
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian path problem
|
| gptkbp:input |
graph
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:optimizationProblem |
no
|
| gptkbp:output |
existence of Hamiltonian path
|
| gptkbp:reduces |
gptkb:Hamiltonian_cycle_problem
|
| gptkbp:reducibleFrom |
gptkb:Traveling_salesman_problem
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle_problem
gptkb:Hamiltonian_path |
| gptkbp:solvableInPolynomialTime |
no (general case)
yes (special cases) |
| gptkbp:studiedBy |
19th century
|
| gptkbp:usedIn |
gptkb:complexity_theory
theoretical computer science algorithm design |
| gptkbp:bfsParent |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsLayer |
4
|