Disjoint (<i>s, t</i>)‐cuts in a network (Q4712978)
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 5323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disjoint (<i>s, t</i>)‐cuts in a network |
scientific article; zbMATH DE number 5323 |
Statements
Disjoint (<i>s, t</i>)‐cuts in a network (English)
0 references
25 June 1992
0 references
pairwise disjoint edge-cuts
0 references
edge weighted graph
0 references
transshipment formulation
0 references
polynomial algorithm
0 references
0.8577337861061096
0 references
0.8052133321762085
0 references
0.7974028587341309
0 references
