Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving shortest paths efficiently on nearly acyclic directed graphs |
scientific article; zbMATH DE number 5129785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving shortest paths efficiently on nearly acyclic directed graphs |
scientific article; zbMATH DE number 5129785 |
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
0.96698964
0 references
0.9350829
0 references
0.9349369
0 references
0 references
0 references
0.9102819
0 references
0.9099864
0 references
0.9053936
0 references
