Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.

Christoph Berkholz Paul S. Bonsma Martin Grohe

Published in: Theory Comput. Syst. (2017)

Keyphrases

lower and upper bounds
lower bound
upper bound
worst case
upper and lower bounds
branch and bound algorithm
lagrangian relaxation
lower bounding
branch and bound
computational complexity
optimal solution
np hard
space complexity
valid inequalities