Premium
Balanced network flows. II. Simple augmentation algorithms
Author(s) -
FremuthPaeger Christian,
Jungnickel Dieter
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-u
Subject(s) - simple (philosophy) , computer science , algorithm , range (aeronautics) , matching (statistics) , flow network , factor (programming language) , maximum flow problem , mathematical optimization , flow (mathematics) , mathematics , philosophy , epistemology , statistics , materials science , geometry , composite material , programming language
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