Matching algorithms are fast in sparse random graphs (2006)

by Holger Bast , Kurt Mehlhorn , Guido Schäfer , Hisao Tamaki
Venue:PROC. OF THE 21ST ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS), LNCS 2996
Citations:7 - 0 self