A more reliable greedy heuristic for maximum matchings in sparse random graphs

Authors:
Martin Dietzfelbinger;Hendrik Peilke;Michael Rink
Affiliations:
Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Germany;IBYKUS AG für Informationstechnologie, Erfurt, Germany;Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Germany
Venue:
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Year:
2012

Citing 12
Cited 0

Data structures and network algorithms

Data structures and network algorithms
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Maximum matchings in sparse random graphs: Karp-Sipser revisited

Random Structures & Algorithms
Greeding matching algorithms, an experimental study

Journal of Experimental Algorithmics (JEA)
Maximum Matchings via Gaussian Elimination

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Gaussian random number generators

ACM Computing Surveys (CSUR)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Finding a maximum matching in a sparse random graph in O(n) expected time

Journal of the ACM (JACM)
Tight thresholds for cuckoo hashing via XORSAT

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Karp-sipser on random graphs with a fixed degree sequence

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c0, independent of the value of c. This is contrary to the behavior of commonly used greedy matching heuristics which are known to have some range of c where they probably fail to compute a maximum matching.