ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Article URLs:
Alternative Article URLs:
Authors: Daniel Neuen
  • RWTH Aachen University
Pascal Schweitzer
  • RWTH Aachen University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/NeuenS18
Author Comments:

Discuss this paper and its artifacts below