%0 Conference Paper %1 conf/stacs/BastMST04 %A Bast, H. %A Mehlhorn, Kurt %A Schäfer, Guido %A Tamaki, Hisao %B STACS %D 2004 %E Diekert, Volker %E Habib, Michel %I Springer %K %P 81-92 %T Matching Algorithms Are Fast in Sparse Random Graphs. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2004.html#BastMST04 %V 2996 %@ 3-540-21236-1

@inproceedings{conf/stacs/BastMST04, added-at = {2023-12-14T15:13:12.000+0100}, author = {Bast, H. and Mehlhorn, Kurt and Schäfer, Guido and Tamaki, Hisao}, biburl = {https://www.bibsonomy.org/bibtex/24605f2b9e5a920118580f81e104ec7b3/admin}, booktitle = {STACS}, crossref = {conf/stacs/2004}, editor = {Diekert, Volker and Habib, Michel}, ee = {https://doi.org/10.1007/978-3-540-24749-4_8}, interhash = {e881604a9e1c5f77f5ba5d49f5f6b7cb}, intrahash = {4605f2b9e5a920118580f81e104ec7b3}, isbn = {3-540-21236-1}, keywords = {}, pages = {81-92}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-14T15:13:12.000+0100}, title = {Matching Algorithms Are Fast in Sparse Random Graphs.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2004.html#BastMST04}, volume = 2996, year = 2004 }