Kernelization Lower Bounds for Finding Constant-Size Subgraphs.

Till Fluschnik George B. Mertzios André Nichterlein

Published in: CiE (2018)

Keyphrases

running times
lower bound
worst case
upper bound
constant factor
branch and bound algorithm
branch and bound
maximum clique
np hard
lower and upper bounds
lower bounding
data structure
data mining
query processing
linear programming relaxation
computational complexity
optimal cost
randomly generated problems