• Corpus ID: 9991410

Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation

  title={Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation},
  author={Jos{\'e} Luis L{\'o}pez-Presa and Antonio Fern{\'a}ndez and Luis N{\'u}{\~n}ez Chiroque},
In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are isomorphic, finding an isomorphism if they are. This algorithm uses the basic individualization/refinement technique, and is an improved version of the algorithm conauto, which has been shown to be very fast for random graphs and several families of hard graphs. In this paper, it is proved that, under some circumstances… 

Figures from this paper

An exponential lower bound for individualization-refinement algorithms for graph isomorphism
A family of graphs on which algorithms based on the individualization-refinement paradigm require exponential time is constructed and this construction is immune to changing the cell selector, the refinement operator, the invariant that is used, or adding various heuristic invariants to the algorithm.
A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors
It is proved that GI can further be solved by a parallel algorithm that runs in polynomial time using a quasipolynomial number of processors, and it is suggested that Graph Isomorphism and GI-complete problems can be computed efficiently in a parallel computer, and provides insights on speeding up parallel GI programs in practice.
Scott: A Method for Representing Graphs as Rooted Trees for Graph Canonization
This article presents a new algorithm based on graph rewriting that provides a general and complete solution to the graph canonization problem and defines a canonical graph notation, so that two isomorphic (sub) graphs have the same canonical form.
Canonical Forms for General Graphs Using Rooted Trees - Correctness and Complexity Study of the SCOTT Algorithm
These proofs ensure that the three canonical forms provided by SCOTT are valid, namely a canonical adjacency matrix, a canonical rooted tree (or DAG) and a canonical string.
Fast Canonical Labelling for Graph based Data Mining
This work presents an algorithm to discover isomorphic graphs using canonical labelling that overcomes this problem based on the symmetries present in the graph, which eliminates the permutation of symmetric nodes in the canonicallabelling process.
Isomorphism Test for Digraphs with Weighted Edges
This paper presents a method for extending the applicability of refinement algorithms to directed graphs with weighted edges using {Traces} as a reference software, and substantiates the claim that the performances of the original algorithm remain substantially unchanged.
Benchmark Graphs for Practical Graph Isomorphism
A construction to efficiently generate small instances for the graph isomorphism problem that are difficult or even infeasible for said solvers is described and it is possible to generate an abundance of instances of arbitrary size.
Apply Partition Tree to Compute Canonical Labelings of Graphs
This paper establishes a theoretical framework by defining a set of concepts useful for classifying graphs and computing the canonical labeling Cmax(G) of a given undirected graph G, which including
Parameterized complexity of distances to sparse graph classes
It is demonstrated that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs, and the term distance parameter is introduced for such parameters and their value is demonstrated in several ways.
Almost Symmetries and the Unit Commitment Problem
This thesis explores two main topics. The first is almost symmetry detection on graphs. The presence of symmetry in combinatorial optimization problems has long been considered an anathema, but in


Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms
This dissertation investigates why these graph families pose difficulty for individualization-refinement algorithms and proposes several techniques for circumventing these limitations and introduces an adaptive refinement method which utilizes the guide-tree data structure of the preceding technique to use a stronger vertex-invariant, but only when needed.
Fast Algorithm for Graph Isomorphism Testing
A novel approach to the graph isomorphism problem is presented, that tries to find a mapping between the two input graphs using backtracking, with a (possibly partial) automorphism precomputing that allows to prune the search tree.
The complexity of McKay's canonical labeling algorithm
  • T. Miyazaki
  • Mathematics, Computer Science
    Groups and Computation
  • 1995
An exponential lower bound is proved of the algorit hm for connected 3-regular graphs of color-class size 4 using Fürer’s construction for these graphs.
Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
The individualization-refinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated and a new partition refinement algorithm is proposed, together with graph invariants having a global nature.
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. III. Graph Invariants and
This paper deals with graph invariants and stabilization procedures. We consider colored graphs and their automorphisms and we discuss the isomorphism problem for such graphs. Various global and
Conflict Propagation and Component Recursion for Canonical Labeling
Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented and Experimental results show that the techniques can result in substantial decrease in both search space sizes and run times.
Exploiting structure in symmetry detection for CNF
A new symmetry-detection tool is presented, SAUCY, which outperforms NAUTY by several orders of magnitude on the large, structured CNF formulas generated from typical EDA problems.
Graph matching applications in pattern recognition and image processing
A taxonomy built considering the most common applications of graph based techniques in the pattern recognition and image processing field is presented and discussed and the role that graphs are conquering within thepattern recognition field is characterized.
Efficient algorithms for graph isomorphism testing
: El problema del isomorfismo de grafos ha sido estudiado por los cientificos durante mucho tiempo, desde distintos puntos de vista. Es interesante desde el punto de vista teorico, puesto que no se
Benchmark graphs for evaluating graph automorphism and canonical labeling algorithms. Laboratory for Theoretical Computer Science, Helsinki
  • University of Technology,
  • 2009