Algorithms for maximum network flow (Q3725836)
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 3956781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for maximum network flow |
scientific article; zbMATH DE number 3956781 |
Statements
Algorithms for maximum network flow (English)
0 references
1986
0 references
survey
0 references
efficient algorithms
0 references
maximum flow problem
0 references
sparse graphs
0 references
rooted trees
0 references
0.910942316055298
0 references
0.8629552721977234
0 references
