Kernelization Lower Bounds for Finding Constant Size Subgraphs.

Till Fluschnik George B. Mertzios André Nichterlein

Published in: CoRR (2017)

Keyphrases

lower bound
maximum clique
branch and bound algorithm
constant factor
upper bound
np hard
computational complexity
data structure
branch and bound
vc dimension
objective function
special case
lower and upper bounds
upper and lower bounds
running times