%0 Conference Paper %1 conf/icalp/CheboluFM08 %A Chebolu, Prasad %A Frieze, Alan M. %A Melsted, Páll %B ICALP (1) %D 2008 %E Aceto, Luca %E Damgård, Ivan %E Goldberg, Leslie Ann %E Halldórsson, Magnús M. %E Ingólfsdóttir, Anna %E Walukiewicz, Igor %I Springer %K dblp %P 161-172 %T Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2008-1.html#CheboluFM08 %V 5125 %@ 978-3-540-70574-1

@inproceedings{conf/icalp/CheboluFM08, added-at = {2019-06-02T00:00:00.000+0200}, author = {Chebolu, Prasad and Frieze, Alan M. and Melsted, Páll}, biburl = {https://www.bibsonomy.org/bibtex/215c287cd9862d2e6661fefb694d9887e/dblp}, booktitle = {ICALP (1)}, crossref = {conf/icalp/2008-1}, editor = {Aceto, Luca and Damgård, Ivan and Goldberg, Leslie Ann and Halldórsson, Magnús M. and Ingólfsdóttir, Anna and Walukiewicz, Igor}, ee = {https://www.wikidata.org/entity/Q59768697}, interhash = {23a12659286fd31ed14ff156b2f72dae}, intrahash = {15c287cd9862d2e6661fefb694d9887e}, isbn = {978-3-540-70574-1}, keywords = {dblp}, pages = {161-172}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-04T13:47:12.000+0200}, title = {Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2008-1.html#CheboluFM08}, volume = 5125, year = 2008 }