Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161)
From MaRDI portal
scientific article; zbMATH DE number 1140059
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
