Complexity of the min-max (regret) versions of min cut problems (Q924631): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:34, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the min-max (regret) versions of min cut problems |
scientific article |
Statements
Complexity of the min-max (regret) versions of min cut problems (English)
0 references
16 May 2008
0 references
min-max
0 references
min-max regret
0 references
complexity
0 references
min cut
0 references
\(\min s-t\) cut
0 references
