Login / Signup

An exponential lower bound for individualization-refinement algorithms for graph isomorphism.

Daniel NeuenPascal Schweitzer
Published in: STOC (2018)
Keyphrases
  • lower bound
  • graph isomorphism
  • worst case
  • data structure
  • orders of magnitude
  • optimal solution
  • branch and bound algorithm