Searching for "Matching Algorithms Are Fast in Sparse Random Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Matching algorithms are fast in sparse random graphs
by Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki — 2006 — Proc. of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 2996
…Matching Algorithms are Fast in Sparse Random Graphs ⋆ Holger Bast 1 , Kurt Mehlhorn 1 , Guido…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB