• Corpus ID: 10433158

Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)

  title={Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)},
  author={Adolfo Piperno},
  • A. Piperno
  • Published 30 April 2008
  • Computer Science
  • ArXiv
The individualization-refinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated. New techniques are introduced with the aim of reducing the size of the associated search space. In particular, a new partition refinement algorithm is proposed, together with graph invariants having a global nature. Experimental results and comparisons with existing tools, such as nauty, reveal that the presented approach produces a huge contraction of the… 

Figures and Tables from this paper

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.

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.

A Characterization of Individualization-Refinement Trees

This work gives a precise and constructive characterization which trees are IR-trees and provides a constructive proof that the necessary conditions are also sufficient for the characterization.

Practical graph isomorphism, II

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.

Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph

It is formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of an input graph, as conauto-2.03, which is incorporated into the GA algorithm conauto, with at most an additive polynomial increase in its asymptotic time complexity.

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

An O((m+n)log n) algorithm is given for finding a canonical version of a stable colouring, on graphs with n vertices and m edges, which captures all known colour refinement algorithms.

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.

An Efficient Graph Isomorphism Algorithm Based on Canonical Labeling and Its Parallel Implementation on GPU

An efficient GI algorithm called PEACE is presented, which is particularly suitable for graphs with high randomness or symmetry, and up to 50% performance increase can be achieved in the best case.

Recursive Algorithms for Generation of Planar Graphs

In this thesis we introduce recursive algorithms for generation of two families of plane graphs. These algorithms start with small graphs and iteratively convert them to larger graphs. The families



Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed.

Canonical labeling of graphs

An algebraic approach to the problem of assigning canonical forms to graphs by computing canonical forms and the associated canonical labelings in polynomial time is announced.

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.

Moderately Exponential Bound for Graph Isomorphism

The first significant complexity result in graph isomorphism testing was the linear time canonical labeling of trees, found by Hopcroft and Tarjan [16~, and independently by V.N. Zemlyachenko [29].

Isomorphism of graphs of bounded valence can be tested in polynomial time

  • E. Luks
  • Mathematics
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
Testing isomorphism of graphs of valence ≤ t is polynomial-time reducible to the color automorphism problem for groups with small simple sections, and some results on primitive permutation groups are used to show that the algorithm runs inPolynomial time.

An optimal lower bound on the number of variables for graph identification

It is shown that Omega (n) variables are needed for first-order logic with counting to identify graphs on n vertices and the lower bound is optimal up to multiplication by a constant.

Stabilization procedures and applications

This thesis introduces an efficient way of computing 1- and 2-stable partitions and presents a particular version of a k-dimensional stabilization algorithm used in chemistry.

Monte-Carlo algorithms in graph isomorphism testing

Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly

Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

The time bound for planar graph isomorphism is improved to O(|V|) time and the algorithm can be easily extended to partition a set of planar graphs into equivalence classes of isomorphic graphs in time linear in the total number of vertices in all graphs in the set.

Isomorphism of graphs with bounded eigenvalue multiplicity

Two polynomial time algorithms are described which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity, if X and Y are graphs of eigenvalue multiplicity m.