Balanced Network Flows. II. Simple Augmentation Algorithms

摘要

In previous papers, we discussed the fundamental theory of matching problems and algorithms in the terms of a network flow model. In this paper, we present explicity 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.