Download:
|
by Michele Zito
In Proc. LATIN 2000, pp 18-27. LNCS 1776
http://www.csc.liv.ac.uk/~michele/PAPERI/tcs.ps.gz
Add To MetaCart
Abstract:
Abstract. We look at the minimal size of a maximal matching in general, bipartite and d-regular random graphs. We prove that with high probability 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 number of systems of linear differential equations. 1
Citations
|
1154
|
Random graphs
– Bollobás
- 1985
|
|
70
|
Differential equations for random processes and random graphs
– Wormald
- 1995
|
|
67
|
An O( √ V E) algorithm for finding maximum matching in general graphs
– Micali, Vazirani
- 1980
|
|
66
|
Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms
– Kirousis, Kranakis, et al.
- 1998
|
|
59
|
Trees and flowers
– Edmonds
- 1965
|
|
59
|
On coloring random graphs
– Grimmet, McDiarmid
- 1975
|
|
48
|
The differential equation method for random graph processes and greedy algorithms, Lectures Notes for Summer School on Randomized Algorithms at Antonin
– Wormald
- 1997
|
|
42
|
Edge dominating sets in graphs
– Yannakakis, Gavril
- 1980
|
|
29
|
On the Existence of a Factor of Degree One of a Connected Random Graph
– Erdös, Rényi
- 1966
|
|
22
|
Randomised techniques in combinatorial algorithmics
– Zito
- 1999
|
|
18
|
On random matrices
– Erdos, Renyi
- 1964
|
|
17
|
On the independence number of random graphs
– Frieze
- 1990
|
|
15
|
An analysis of the greedy heuristic for independence systems
– Korte, Hausmann
- 1978
|
|
12
|
Independent sets in regular graphs of high girth
– McKay
- 1987
|
|
9
|
An O(v 1=2 e) algorithm for finding maximum matching in general graphs
– Micali, Vazirani
- 1980
|
|
8
|
An improved upper bound on the non-3colourability threshold
– Dunne, Zito
- 1998
|
|
8
|
An n 5=2 algorithm for maximal matchings in bipartite graphs
– Hopcroft, Karp
- 1973
|
