Prasad Chebolu, Alan M. Frieze, Páll Melsted. Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Volume 5125 of Lecture Notes in Computer Science, pages 161-172, Springer, 2008. [doi]
@inproceedings{CheboluFM08,
title = {Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time},
author = {Prasad Chebolu and Alan M. Frieze and Páll Melsted},
year = {2008},
doi = {10.1007/978-3-540-70575-8_14},
url = {http://dx.doi.org/10.1007/978-3-540-70575-8_14},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CheboluFM08},
cites = {0},
citedby = {0},
pages = {161-172},
booktitle = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games},
editor = {Luca Aceto and Ivan Damgård and Leslie Ann Goldberg and Magnús M. Halldórsson and Anna Ingólfsdóttir and Igor Walukiewicz},
volume = {5125},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-70574-1},
}