Balanced Network Flows

  title={Balanced Network Flows},
  author={William Kocay and Douglas Stone},
Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum balanced edgecuts. A max-balanced-flow algorithm will solve the factor problem. 1. Balanced Networks… CONTINUE READING
4 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

A short proof of the factor theorem for finite graphs, Can

  • W. T. Tutte
  • J. Math.,
  • 1954
Highly Influential
9 Excerpts

Min-max results in combinatorial optimization, in Mathematical Programming — the State of the Art

  • A. Schrijver
  • 1983
2 Excerpts

Three short proofs in graph theory, JCT(B

  • Laszlo Lovasz
  • 1975

Graph Theory, Addison-Wesley Publishing

  • Frank Harary
  • 1969

Three short proofs in graph theory

  • Laszlo Lovasz
  • 1969

Graphs with prescribed degrees of vertices, (Hungarian)

  • P. Erdös, T. Gallai
  • Mat. Lapok
  • 1960
1 Excerpt

Similar Papers

Loading similar papers…