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 c > 0, 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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Dietzfelbinger, M., Peilke, H., & Rink, M. (2012). A more reliable greedy heuristic for maximum matchings in sparse random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7276 LNCS, pp. 148–159). https://doi.org/10.1007/978-3-642-30850-5_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
