Maximum balanced flow in a network (Q1569079)
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: Maximum balanced flow in a network |
scientific article; zbMATH DE number 1464306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum balanced flow in a network |
scientific article; zbMATH DE number 1464306 |
Statements
Maximum balanced flow in a network (English)
0 references
25 June 2000
0 references
A ``parity problem'' for a network flow is posed, and solved by reducing it to the \(b\)-matching problem in a graph. The result is claimed to be instrumental in some interesting cases of integer multiflow optimization; these applications are given in \textit{H. Ilani}, \textit{E. Korach} and \textit{M. Lomonosov} [J. Comb. Theory, Ser. B 79, 183-210 (2000; Zbl 1025.05049)].
0 references
balanced flow
0 references
matchings
0 references
multiflow optimization
0 references
0 references
0.91112494
0 references
0 references
0.9054625
0 references
0 references
0.9009354
0 references
0 references
0 references
0.8953312
0 references
0 references
