On the \(k\)-cut subgraph polytope (Q1340072)
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 700818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-cut subgraph polytope |
scientific article; zbMATH DE number 700818 |
Statements
On the \(k\)-cut subgraph polytope (English)
0 references
11 December 1994
0 references
minimum cut
0 references
reliability
0 references
minimum-cost set of \(k\) pairwise-disjoint \((s,t)\)-cuts in a graph
0 references
polyhedral interpretations
0 references
0.8577337861061096
0 references
0.8235660791397095
0 references
