Isomorphism Test for Digraphs with Weighted Edges

Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges. We use {Traces} as a reference software, but the proposed solution is easily transferrable to any other refinement-based graph isomorphism tool in the literature. We substantiate the claim that the performances of the original algorithm remain substantially unchanged by showing experiments for some classes of benchmark graphs.

[1]  A. V. Uskov,et al.  An algorithm for the reduction of finite non-oriented graphs to canonical form , 1974 .

[2]  Antonio Fernández,et al.  Fast Algorithm for Graph Isomorphism Testing , 2009, SEA.

[3]  Antonio Fernández,et al.  Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation , 2011, ArXiv.

[4]  Paul S. Bonsma,et al.  Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement , 2013, Theory of Computing Systems.

[5]  Paul S. Bonsma,et al.  Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement , 2016, Theory of Computing Systems.

[6]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[7]  Petteri Kaski,et al.  Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs , 2007, ALENEX.

[8]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[9]  Petteri Kaski,et al.  Conflict Propagation and Component Recursion for Canonical Labeling , 2011, TAPAS.

[10]  Adolfo Piperno,et al.  Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version) , 2008, ArXiv.

[11]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

[12]  László Babai,et al.  Graph isomorphism in quasipolynomial time [extended abstract] , 2016, STOC.

[13]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[14]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[15]  Daniel Neuen,et al.  Benchmark Graphs for Practical Graph Isomorphism , 2017, ESA 2017.

[16]  Igor L. Markov,et al.  Faster symmetry discovery using sparsity of symmetries , 2008, 2008 45th ACM/IEEE Design Automation Conference.