Balanced Network Flows. VIII. A Revised Theory of Phase-Ordered Algorithms and the O(√nm log(n2/m)/log n) Bound for the Nonbipartite Cardinality Matching Problem

Networks

Volumn 41, Issue 3, 2003, Pages 137-142

  Fremuth Paeger, Christian ^a   Jungnickel, Dieter ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Antisymmetrical digraphs; Cardinality matching problem; Clique partition; Graph compression; Network flows; Skew symmetric graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

ANTISYMMETRICAL DIGRAPHS; CARDINALITY MATCHING PROBLEM; CLIQUE PARTITION; GRAPH COMPRESSION; NETWORK FLOWS; SKEW-SYMMETRIC GRAPHS;

PROBLEM SOLVING;

EID: 2142830968     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10066     Document Type: Article

References (12)

1. N. Blum, A simplified realization of the Hopcroft-Karp approach to maximum matching in general graphs, Technical report, University of Bonn, 1999.
2. T. Feder and R. Motwani, Clique partitions, graph compression and speeding up algorithms, JCSS 51 (1995), 261-272.
3. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (I): A unifying framework for design and analysis of matching algorithms, Networks 33 (1999), 1-28.
4. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (II): Simple augmentation algorithms, Networks 33 (1999), 29-41.
5. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (III): Strongly polynomial augmentation algorithms, Networks 33 (1999), 43-56.
6. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (IV): Duality and structure theory, Networks 37 (2001), 194-201.
7. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (V): Cycle canceling algorithms, Networks 37 (2001), 202-209.
8. C. Fremuth-Paeger and D. Jungnickel, Balanced network flows (VI): Polyhedral descriptions, Networks 37 (2001), 210-218.
9. A. Goldberg and A.V. Karzanov, Maximum skew-symmetric flows, preprint, 1995.
10. A. Goldberg and A.V. Karzanov, Maximum skew-symmetric flows and their applications to b-matchings, preprint, 1999.
11. M. Loehnertz, Alternating path algorithms for non-bipartite matching using graph compression, Technical report, University of Bonn, 2001.
12. S. Micali and V.V, Vazirani, An O(√V E) algorithm for finding maximum matching in general graphs, Proc 21st Ann IEEE Symp in Foundation of Computer Science, IEEE Press, Piscataway, NJ, 1980, pp. 17-27.