Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving shortest paths efficiently on nearly acyclic directed graphs |
scientific article |
Statements
Solving shortest paths efficiently on nearly acyclic directed graphs (English)
0 references
26 February 2007
0 references
shortest path algorithm
0 references
nearly acyclic graph
0 references
graph decomposition
0 references
