Balanced network flows. I. A unifying framework for design and analysis of matching algorithms

Networks

Volumn 33, Issue 1, 1999, Pages 1-28

  Fremuth Paeger, Christian ^a   Jungnickel, Dieter ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Antisymmetrical digraphs; Augmenting a matching; Balanced flow networks; Blossoms; Capacitated matching problems; Layered auxiliary networks; Network flows; Nuclei; Skew symmetric graphs

Indexed keywords

EID: 0032608479     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M     Document Type: Article

References (28)

1. [1] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice Hall, Englewood Cliffs, NJ (1993).
2. [2] R. P. Anstee, An algorithmic proof of Tutte's f-factor theorem, J Alg 6 (1985), 112-131.
3. [3] C. Berge, Two theorems in graph theory, Proceed Nat Acad Sci 43 (1957), 842-844.
4. [4] W. H. Cunningham and A. B. Marsh, A primal algorithm for optimum matching, Math Program Study 8 (1978), 50-72.
5. [5] U. Derigs, Programming in networks and graphs, Springer, Heidelberg, 1988.
6. [6] J. Edmonds, Maximum matching and a polyhedron 0,1 vertices, J Res Natl Bur Stand Sect B 69 (1965), 125-130.
7. [7] J. Edmonds, Paths, trees and flowers, Can J Math 17 (1965), 449-467.
8. [8] S. Even and R. E. Tarjan, Network flow and testing graph connectivity, SIAM J Comput 4 (1975), 507-512.
9. [9] L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
10. [10] C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (II): Simple augmentation algorithms, Networks, to appear.
11. [11] C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (III): Strongly polynomial augmentation algorithms, Networks, to appear.
12. [12] C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (IV): Duality and structure theory, Networks, submitted.
13. [13] C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (V): Cycle canceling algorithms, Networks, submitted.
14. [14] A. Goldberg and A. V. Karzanov, Path problems in skew-symmetric graphs, Combinatorica 16 (1996), 353-382.
15. [15] P. Hell and D. G. Kirkpatrick, Algorithms for degree constrained graph factors of minimum deficiency, J Alg 14 (1993), 115-138.
16. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J Comput 2 (1973), 225-231.
17. [17] D. Jungnickel, Graphen, Netzwerke und Algorithmen, 3rd ed. BI-Wissenschafts-verlag, Mannheim, 1994. English edition to appear in 1998 published by Springer.
18. [18] T. Kameda and I. Munro, An O (|V|*|E|) algorithm for maximum matching of graphs, Computing 12 (1974), 91-98.
19. [19] W. Kocay and D. Stone, Balanced network flows, Bull ICA 7 (1993), 17-32.
20. [20] W. Kocay and D. Stone, An algorithm for balanced flows, JCMCC 19 (1995), 3-31.
21. [21] L. Lovasz and M. D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.
22. [22] A. B. Marsh, Matching algorithms, PhD Thesis, John Hopkins University, Baltimore, 1979.
23. [23] S. Micali and V. V. Vazirani, An O(√V E) algorithm for finding maximum matching in general graphs, Proceedings of the 21st Annual IEEE Symposium in Foundation of Computer Science, 1980, pp. 17-27.
24. [24] U. Pape and D. Conradt, Maximales matching in graphen, Ausgewählte Operations Research Software in FORTRAN, H. Späth (Editor), Oldenbourg, Munich, 1980, 103-114.
25. [25] W. Pulleyblank, Faces of matching polyhedra, PhD Thesis, University of Waterloo, 1973.
26. [26] W. T. Tutte, The factors of graphs, Can J Math 4 (1952), 314-328.
27. [27] W. T. Tutte, Antisymmetrical digraphs. Can J Math 19 (1967), 1101-1117.
28. [28] V. V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O(√V E) general graph maximum matching algorithm, Combinatorica 14 (1994), 71-109.