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 pro ving its validity, we explain how it is implemented in several of the key implementations. 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.
%0 Journal Article
%1 McKay2014
%A McKay, Brendan D.
%A Piperno, Adolfo
%D 2014
%J Journal of Symbolic Computation
%K Canonical Graph Nauty Partition Traces isomorphism labelling refinement
%N 0
%P 94 - 112
%R 10.1016/j.jsc.2013.09.003
%T Practical graph isomorphism, II
%U http://www.sciencedirect.com/science/article/pii/S0747717113001193
%V 60
%X 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 pro ving its validity, we explain how it is implemented in several of the key implementations. 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.
@article{McKay2014,
abstract = {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 pro ving its validity, we explain how it is implemented in several of the key implementations. 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. },
added-at = {2013-12-30T17:31:13.000+0100},
author = {McKay, Brendan D. and Piperno, Adolfo},
biburl = {https://www.bibsonomy.org/bibtex/28aadec2851e6baf900e3f362a6e5b437/rlanger},
description = {Practical graph isomorphism, II},
doi = {10.1016/j.jsc.2013.09.003},
interhash = {2a0f8913ec5851686b337eb511a8ff7f},
intrahash = {8aadec2851e6baf900e3f362a6e5b437},
issn = {0747-7171},
journal = {Journal of Symbolic Computation },
keywords = {Canonical Graph Nauty Partition Traces isomorphism labelling refinement},
number = 0,
pages = {94 - 112},
timestamp = {2014-01-10T20:03:51.000+0100},
title = {Practical graph isomorphism, II},
url = {http://www.sciencedirect.com/science/article/pii/S0747717113001193},
volume = 60,
year = 2014
}