We look at the minimal size of a maximal matching in general, bipartite and d-regular random graphs. We prove that the ratio between the sizes of any two maximal matchings approaches one in dense random graphs and random bipartite graphs. Weaker bounds hold for sparse random graphs and random d-regular graphs. We also describe an algorithm that with high probability finds a matching of size strictly less than n/2 in a cubic graph. The result is based on approximating the algorithm dynamics by a system of linear differential equations. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Zito, M. (2000). Small maximal matchings in random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 18–27). https://doi.org/10.1007/10719839_2
Mendeley helps you to discover research relevant for your work.