Shortest path algorithms for nearly acyclic directed graphs (Q1274325)
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: Shortest path algorithms for nearly acyclic directed graphs |
scientific article; zbMATH DE number 1238339
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path algorithms for nearly acyclic directed graphs |
scientific article; zbMATH DE number 1238339 |
Statements
Shortest path algorithms for nearly acyclic directed graphs (English)
0 references
12 January 1999
0 references
algorithm
0 references
shortest paths
0 references
acyclic graph
0 references
nearly acyclic graph
0 references
priority queue
0 references
Fibonacci heap
0 references
Dijkstra's algorithm
0 references
