Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638)
From MaRDI portal
scientific article; zbMATH DE number 5279327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts |
scientific article; zbMATH DE number 5279327 |
Statements
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (English)
0 references
27 May 2008
0 references
Maximum Flow
0 references
Reoptimization
0 references
Robust Minimum Cut
0 references
0 references
