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

New York, NY / ACM (2018) [Contribution to a book, Contribution to a conference proceedings]

STOC'18 : Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA / sponsored by: ACM SIGACT
Page(s): 138-150

Authors

Authors

Neuen, Daniel
Schweitzer, Pascal

Identifier

Sources