Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
bioinformatics
network analysis scheduling |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
The problem of finding a simple path of maximum length in a given graph.
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstDescribed |
1970s
|
| gptkbp:generalizes |
gptkb:Hamiltonian_path_problem
|
| gptkbp:hasSpecialCase |
path problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Longest path problem
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path_problem
gptkb:shortest_path_problem graph path NP-hard problem |
| gptkbp:solvableInPolynomialTime |
no (for general graphs)
yes (for directed acyclic graphs) |
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|