Lower Bounds for the Size of Random Maximal H-Free Graphs.

Published in: Electron. J. Comb. (2009)

Keyphrases

lower bound
upper bound
independent set
objective function
undirected graph
uniform random
maximal cliques
np hard
branch and bound algorithm
graph matching
graph mining
small size
memory requirements
upper and lower bounds
block size
max sat
random instances
maximum clique
special case
computational complexity