Maximum Induced Matchings of Random Cubic Graphs
نویسندگان
چکیده
We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching, M, returned by the algorithm. A corresponding upper bound is derived by means of a direct expectation argument. We prove that M asymptotically almost surely satisfies 0.270413n ≤ |M| ≤ 0.282069n.
منابع مشابه
Small Maximal Matchings in Random Graphs
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 dregular graphs. We also describe an algorithm that with high probability finds a matching of size stri...
متن کاملThe Cost of Perfection for Matchings in Graphs
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the application in triangle meshes, where we seek to convert a triangulation into a quadrangulation by merging pairs of adjacent triangles, we focus on bridgeless cubic graph...
متن کاملControllability and matchings in random bipartite graphs
Motivated by an application in controllability we consider maximum matchings in random bipartite graphs G = (A,B). First we analyse Karp–Sipser’s algorithm to determine the asymptotic size of maximum matchings in random bipartite graphs with a fixed degree distribution. We then allow an adversary to delete one edge adjacent to every vertex in A in the more restricted model where each vertex in ...
متن کاملInduced matchings in cubic graphs
In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching.
متن کاملSub–optimality of local algorithms on sparse random graphs by
Sub–optimality of local algorithms on sparse random graphs Mustazee Rahman Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2015 This thesis studies local algorithms for solving combinatorial optimization problems on large, sparse random graphs. Local algorithms are randomized algorithms that run in parallel at each vertex of a graph by using only local information ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000