Practical graph isomorphism, II
Discrete Mathematics
2013-01-09 v1 Combinatorics
Abstract
We report the current state of the graph isomorphism problem from the practical point of view. After describing the general principles of the refinement-individualization paradigm and proving its validity, we explain how it is implemented in several of the key programs. In particular, we bring the description of the best known program nauty up to date and describe an innovative approach called Traces that outperforms the competitors for many difficult graph classes. Detailed comparisons against saucy, Bliss and conauto are presented.
Keywords
Cite
@article{arxiv.1301.1493,
title = {Practical graph isomorphism, II},
author = {Brendan D. McKay and Adolfo Piperno},
journal= {arXiv preprint arXiv:1301.1493},
year = {2013}
}
Comments
This is partially a replacement for http://arxiv.org/abs/0804.4881