Corpus ID: 237513352

A Characterization of Individualization-Refinement Trees

@article{Anders2021ACO,
  title={A Characterization of Individualization-Refinement Trees},
  author={Markus Anders and Jendrik Brachter and Pascal Schweitzer},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.07302}
}
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in general. Through backtracking, on each graph an IR-algorithm implicitly creates an IR-tree whose order is the determining factor of the running time of the algorithm. We give a precise and constructive characterization which trees are IR-trees. This characterization is applicable both when the tree is regarded as an… Expand

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
TLDR
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. Expand
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms
TLDR
A search problem on trees that closely captures the backtracking behavior of all current practical graph isomorphism algorithms, and a randomized algorithm with errors for which the number of visited leaves is quasilinear in the square root of the size of the smaller of the two trees. Expand
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
TLDR
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. Expand
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
TLDR
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. Expand
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
TLDR
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. Expand
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes allExpand
Practical graph isomorphism, II
TLDR
The description of the best known program nauty is brought up to date and an innovative approach called Traces that outperforms the competitors for many difficult graph classes is described. Expand
Equivalence in Finite-Variable Logics is Complete for Polynomial Time
TLDR
A corollary of the main result is that the question of whether two finite graphs can be distinguished by the k-dimensional Weisfeiler–Lehman algorithm is P-complete for each . Expand
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
We consider three computational problems with unknown complexity status: The graph isomorphism problem, the problem of computing van der Waerden numbers and the problem of computing Ramsey numbers.Expand
Exploiting structure in symmetry detection for CNF
TLDR
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. Expand
...
1
2
3
...