Short proofs on multicommodity flows and cuts (Q1186123)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Short proofs on multicommodity flows and cuts |
scientific article; zbMATH DE number 36233
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short proofs on multicommodity flows and cuts |
scientific article; zbMATH DE number 36233 |
Statements
Short proofs on multicommodity flows and cuts (English)
0 references
28 June 1992
0 references
The author gives a short and elementary proof of Karzanov's theorem about pairwise disjoint cuts in a connected bipartite graph not containing one of two forbidden subgraphs. As consequence of this theorem the author gets a condition for the existence of half-integral multicommodity flows in a transport net.
0 references
multicommodity flows
0 references
packing of cuts
0 references
Karzanov's theorem
0 references
connected bipartite graph
0 references
