Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1140059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem |
scientific article; zbMATH DE number 1140059 |
Statements
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (English)
0 references
3 August 1998
0 references
generalized circulation problem
0 references
highest-gain augmenting paths
0 references
worst-case complexities
0 references
0.87956834
0 references
0.8699025
0 references
0.8689547
0 references
0.8644972
0 references
0.8622478
0 references
0.8560086
0 references
0.85334766
0 references
