A note on specialized versus unspecialized methods for maximum-flow problems (Q3316929)
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 3847192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on specialized versus unspecialized methods for maximum-flow problems |
scientific article; zbMATH DE number 3847192 |
Statements
A note on specialized versus unspecialized methods for maximum-flow problems (English)
0 references
1984
0 references
network flow
0 references
comparison of algorithms
0 references
label tree
0 references
primal simplex
0 references
maximum flow problem
0 references
0.8670727610588074
0 references
0.7917433977127075
0 references
