Balanced network flows. II. Simple augmentation algorithms
Christian Fremuth‐Paeger, Dieter Jungnickel · Networks · 1999
In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k-factor problems and the f-factor problem. © 1999 John Wiley & Sons, Inc. Networks 33: 29–41, 1999