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. © 2013 Elsevier B.V.
Practical graph isomorphism, II / Brendan D., Mckay; Piperno, Adolfo. - In: JOURNAL OF SYMBOLIC COMPUTATION. - ISSN 0747-7171. - STAMPA. - 60:(2014), pp. 94-112. [10.1016/j.jsc.2013.09.003]
Practical graph isomorphism, II
PIPERNO, Adolfo
2014
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. © 2013 Elsevier B.V.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
