A probabilistic analysis of some greedy cardinality matching algorithms

This publication has 7 references indexed in Scilit:

• Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
  Published by Springer Nature ,1980
• An Analysis of the Greedy Heuristic for Independence Systems
  Annals of Discrete Mathematics, 1978
• Fast probabilistic algorithms for hamiltonian circuits and matchings
  Published by Association for Computing Machinery (ACM) ,1977
• Cliques in random graphs
  Mathematical Proceedings of the Cambridge Philosophical Society, 1976
• An O (N2.5) algorithm for maximum matching in general graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965