Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
Christoph BerkholzPaul S. BonsmaMartin GrohePublished in: ESA (2013)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- worst case
- upper and lower bounds
- lower bounding
- branch and bound algorithm
- lagrangian relaxation
- valid inequalities
- space complexity
- decision problems
- branch and bound
- colour images
- itemsets
- dynamic programming
- np hard
- evolutionary algorithm
- exact and approximate
- computational complexity