Small maximal matchings in random graphs

Theoretical Computer Science

Volumn 297, Issue 1-3, 2003, Pages 487-507

  Zito, Michele ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBABILITY;

RANDOM BIPARTITE GRAPHS;

COMPUTER SCIENCE;

EID: 0037285651     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00653-9     Document Type: Conference Paper

References (16)

1. Bollobás B. Random Graphs. 1985;Academic Press, New York.
2. Dunne P.E., Zito M. An improved upper bound on the non-3-colourability threshold. Inform. Process. Lett. 65:1998;17-23.
3. Edmonds J. Paths, trees and flowers. Canad. J. Math. 15:1965;449-467.
4. Erdos P., Rényi A. On random matrices. Publ. Math. Inst. Hungar. Acad. Sci. 8:1964;455-461.
5. Erdos P., Rényi A. On the existence of a factor of degree one of a connected random graph. Acta Math. Acad. Sci. Hungar. 17(3-4):1966;359-368.
6. Frieze A.M. On the independence number of random graphs. Discrete Math. 81(2):1990;171-175.
7. Grimmett G.R., McDiarmid C.J.H. On colouring random graphs. Math. Proc. Cambridge Philos. Soc. 77:1975;313-324.
8. 5/2 algorithm for maximal matching in bipartite graphs SIAM J. Comput. 2:1973;225-231.
9. Kirousis L.M., Kranakis E., Krizanc D., Stamatiou Y.C. Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms. 12(3):1998;253-269.
10. Korte B., Hausmann D. An analysis of the greedy heuristic for independence systems. Ann. Discrete Math. 2:1978;65-74.
11. McKay B.D. Independent sets in regular graphs of high girth. Ars Combin. 23A:1987;179-185.
12. 1/2 e) algorithm for finding maximum matching in general graphs Proc. 21st Ann. Symp. on Foundations of Computer Science, New York. 1980;17-27 IEEE Computer Society Press, Silver Spring, MD.
13. Wormald N.C. Differential equations for random processes and random graphs. Ann. Appl. Probab. 5:1995;1217-1235.
14. Wormald N.C. The differential equation method for random graph processes and greedy algorithms. Karoński M., Prömel H.J. Lectures on Approximation and Randomized Algorithms. 1999;73-155 PWN, Warsaw.
15. Yannakakis M., Gavril F. Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3):1980;364-372.
16. M. Zito, Randomised techniques in combinatorial algorithmics, Ph.D. Thesis, Department of Computer Science, University of Warwick, 1999.