Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:citation |
David Eppstein, 'Finding the k shortest paths', SIAM J. Comput., 1998
|
| gptkbp:complexity |
O(m + n log n + k)
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Eppstein's algorithm
|
| gptkbp:input |
weighted directed graph
two vertices |
| gptkbp:namedAfter |
gptkb:David_Eppstein
|
| gptkbp:output |
k shortest paths
|
| gptkbp:publishedIn |
1994
|
| gptkbp:solvedBy |
gptkb:k_shortest_paths_problem
|
| gptkbp:bfsParent |
gptkb:David_Eppstein
|
| gptkbp:bfsLayer |
5
|