Practical graph isomorphism, II
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2013
- DOI:
- 10.48550/arXiv.1301.1493
- arXiv:
- arXiv:1301.1493
- Bibcode:
- 2013arXiv1301.1493M
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Mathematics - Combinatorics;
- 05C85;
- 68R10;
- 20B40
- E-Print:
- This is partially a replacement for http://arxiv.org/abs/0804.4881