Login / Signup
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism.
Daniel Neuen
Pascal Schweitzer
Published in:
CoRR (2017)
Keyphrases
</>
lower bound
graph isomorphism
worst case
data structure
upper bound
orders of magnitude
branch and bound
objective function
optimal solution
computational complexity
special case