Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1590485676 / rank | |||
Normal rank | |||
Revision as of 19:28, 19 March 2024
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
