An \(O(nm)\)-time network simplex algorithm for the shortest path problem (Q2770116)
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: An \(O(nm)\)-time network simplex algorithm for the shortest path problem |
scientific article; zbMATH DE number 1702826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(nm)\)-time network simplex algorithm for the shortest path problem |
scientific article; zbMATH DE number 1702826 |
Statements
7 February 2002
0 references
shortest paths
0 references
network simplex algorithm
0 references
An \(O(nm)\)-time network simplex algorithm for the shortest path problem (English)
0 references
