Maximum matching in sparse random graphs
Authors:
- R. M. KarpRKR. M. Karp
- M. SipserMSM. Sipser
- 1 October 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 364-375
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Solutions of ordinary differential equations as limits of pure jump markov processesJournal of Applied Probability, 1970
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966