Login / Signup
Matching Algorithms Are Fast in Sparse Random Graphs.
Hannah Bast
Kurt Mehlhorn
Guido Schäfer
Hisao Tamaki
Published in:
STACS (2004)
Keyphrases
</>
random graphs
optimization problems
matching algorithm
data structure
computational complexity