Computational Comparison of Eight Methods for the Maximum Network Flow Problem (Q3870686)
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: Computational Comparison of Eight Methods for the Maximum Network Flow Problem |
scientific article; zbMATH DE number 3673877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Comparison of Eight Methods for the Maximum Network Flow Problem |
scientific article; zbMATH DE number 3673877 |
Statements
Computational Comparison of Eight Methods for the Maximum Network Flow Problem (English)
0 references
1980
0 references
computational comparison of eight methods
0 references
maximum network flow problem
0 references
depth-first search
0 references
breadth-first search
0 references
largest-augmentation
0 references
layer- updating
0 references
Karzanov algorithm
0 references
Kinariwala-Rao algorithm
0 references
flow augmentation along paths
0 references
flow augmentation through layers
0 references
Dinic algorithm
0 references
comparison of algorithms
0 references
