Matching algorithms are fast in sparse random graphs

Theory of Computing Systems

Volumn 39, Issue 1, 2006, Pages 3-14

  Bast, Holger ^a   Mehlhorn, Kurt ^a   Schafer, Guido ^a   Tamaki, Hisao ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTING PATH; AVERAGE DEGREE; AVERAGE-CASE ANALYSIS; BIPARTITE GRAPHS; CARDINALITY MATCHING; HIGH PROBABILITY; MATCHING ALGORITHM; RANDOM GRAPHS;

ALGORITHMS;

GRAPH THEORY;

EID: 30744444929     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1254-y     Document Type: Conference Paper

References (14)

1. [AZ] M. Aigner and G. M. Ziegler. Proofs from THE BOOK, third edition. Springer, New York, 2004.
2. +] B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi. Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. The ACM Journal of Experimental Algorithmics, 3, 1998. http://www.jea.acm.org/1998/CherkasskyAugment.
3. [CM] J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmic, 15(6):521-549, 1996.
4. [Ed1] J. Edmonds. Maximum matching and a polyhedron with (0, 1) vertices. Journal of Research of the National Bureau of Standards, 69(b):125-130, 1965.
5. [Ed2] J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
6. [ER] P. Erdos and A. Rényi. On random graphs. Publications Mathematicae Debrecen, 6:290-297, 1959.
7. [FM] T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. Journal of Computer and System Sciences, 51(2):261-272, 1995.
8. [Ga] H. N. Gabow. An efficient implementation of Edmonds' algorithm for maximum matching on graphs. Journal of the ACM, 23:221-234, 1976.
9. [Gn] Gnuplot. http://www.gnuplot.info.
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225-231, 1973.
11. [MN] K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, 1999.
12. [Mo] R. Motwani. Average-case analysis of algorithms for matchings and related problems. Journal of the ACM, 41(6): 1329-1356, 1994.
13. [MS] F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, first edition. North-Holland, Amsterdam, 1977.
14. 0.5|E|) algorithm for finding maximum matchings in general graphs. In Proceeding of the 21st Annual Symposium on Foundations of Computer Science, pages 17-27, 1980.