Some Generalized Max-Flow Min-Cut Problems in the Plane (Q3978618)
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 12565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Generalized Max-Flow Min-Cut Problems in the Plane |
scientific article; zbMATH DE number 12565 |
Statements
Some Generalized Max-Flow Min-Cut Problems in the Plane (English)
0 references
25 June 1992
0 references
max-flow min-cut
0 references
polynomial algorithm
0 references
\(\mathcal NP\)-completeness
0 references
network survivability
0 references
damages
0 references
planar graph
0 references
min-break problem
0 references
max linkage problem
0 references
0.7651649713516235
0 references
0.7627958059310913
0 references
0.7608855366706848
0 references
