Matching Algorithms Are Fast in Sparse Random Graphs.

Hannah Bast Kurt Mehlhorn Guido Schäfer Hisao Tamaki

Published in: Theory Comput. Syst. (2006)

Keyphrases

random graphs
matching algorithm
computational complexity
upper bound
worst case
data structure
evolutionary algorithm
graph matching