%0 Journal Article %1 journals/mst/BastMST06 %A Bast, H. %A Mehlhorn, Kurt %A Schäfer, Guido %A Tamaki, Hisao %D 2006 %J Theory Comput. Syst. %K %N 1 %P 3-14 %T Matching Algorithms Are Fast in Sparse Random Graphs. %U http://dblp.uni-trier.de/db/journals/mst/mst39.html#BastMST06 %V 39

@article{journals/mst/BastMST06, added-at = {2023-12-13T00:47:21.000+0100}, author = {Bast, H. and Mehlhorn, Kurt and Schäfer, Guido and Tamaki, Hisao}, biburl = {https://www.bibsonomy.org/bibtex/2e39e0ca4496ccd5ccc3f7ba20f1649f7/admin}, ee = {https://doi.org/10.1007/s00224-005-1254-y}, interhash = {6867cda4eb853cd48939eab63323b3fe}, intrahash = {e39e0ca4496ccd5ccc3f7ba20f1649f7}, journal = {Theory Comput. Syst.}, keywords = {}, number = 1, pages = {3-14}, timestamp = {2023-12-13T00:47:21.000+0100}, title = {Matching Algorithms Are Fast in Sparse Random Graphs.}, url = {http://dblp.uni-trier.de/db/journals/mst/mst39.html#BastMST06}, volume = 39, year = 2006 }