Premium
Balanced network flows. V. Cycle‐canceling algorithms
Author(s) -
FremuthPaeger Christian,
Jungnickel Dieter
Publication year - 2001
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/net.1014
Subject(s) - matching (statistics) , flow network , computer science , algorithm , flow (mathematics) , mathematical optimization , mathematics , statistics , geometry
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. © 2001 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom