Matching algorithms are fast in sparse random graphs (2006)
Cached
Download Links
- [www.math.tu-berlin.de]
- [www.mpi-inf.mpg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | PROC. OF THE 21ST ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS), LNCS 2996 |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Bast06matchingalgorithms,
author = {Holger Bast and Kurt Mehlhorn and Guido Schäfer and Hisao Tamaki},
title = {Matching algorithms are fast in sparse random graphs},
booktitle = {PROC. OF THE 21ST ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS), LNCS 2996},
year = {2006},
pages = {81--92},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability every nonmaximum matching has an augmenting path of length O(log n). This implies that augmenting path algorithms like the Hopcroft–Karp algorithm for bipartite graphs and the Micali–Vazirani algorithm for general graphs, which have a worst case running time of O(m √ n), run in time O(m log n) with high probability, where m is the number of edges in the graph. Motwani proved these results for random graphs when the average degree is at least ln(n) [Average Case Analysis of Algorithms for Matchings and Related Problems, Journal of the ACM, 41(6), 1994]. Our results hold, if only the average degree is a large enough constant. At the same time we simplify the analysis of Motwani.
