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.

This is partially a replacement for http://arxiv.org/abs/0804.4881

Cited by in corpus (7)

• Graph Isomorphism in Quasipolynomial Time
• Minimally subtracted six loop renormalization of $O(n)$-symmetric ${\varphi }^4$ theory and critical exponents
• On Graph Isomorphism Problem
• The Graph Isomorphism Problem: Local Certificates for Giant Action
• On the Automorphism Group of a Graph
• SNAC: An Unbiased Metric Evaluating Topology Recognize Ability of Network Alignment
• Cumulants as the Variables of Density Cumulant Theory: A Path to Hermitian Triples