Cite
HARVARD Citation
Anastos, M. et al. (2021). Finding maximum matchings in random regular graphs in linear expected time. Random structures & algorithms. 58 (3), pp. 390-429. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Anastos, M. et al. (2021). Finding maximum matchings in random regular graphs in linear expected time. Random structures & algorithms. 58 (3), pp. 390-429. [Online].