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

Christoph Berkholz Paul S. Bonsma Martin Grohe

Published in: CoRR (2015)

Keyphrases

lower and upper bounds
lower bound
upper bound
worst case
upper and lower bounds
branch and bound
branch and bound algorithm
lower bounding
lagrangian relaxation
valid inequalities
data sets
objective function
decision problems
approximation algorithms
support vector