Balanced network flows. V. Cycle-canceling algorithms
We discuss Anstee's approach for solving generalized matching problems by solving an ordinary flow problem on a balanced network first. We give a description of the algorithm which applies not only to matching problems, but also to the general setting. (C) 2001 John Wiley & Sons, Inc.
network flows capacitated matching problems balanced-flow networks skew-symmetric graphs antisymmetrical digraphs