Breaking symmetries in graphs: The nauty way

Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


Symmetry breaking is an essential component when solving graph search problems as it restricts the search space to that of canonical representations. There are an abundance of powerful tools, such as nauty, which apply to find the canonical representation of a given graph and to test for isomorphisms given a set of graphs. In contrast, for graph search problems, current symmetry breaking techniques are partial and solvers unnecessarily explore an abundance of isomorphic parts of the search space. This paper is novel in that it introduces complete symmetry breaking for graph search problems by modeling, in terms of constraints, the same ideas underlying the algorithm applied in tools like nauty. Whereas nauty tests given graphs, symmetry breaks restrict the search space and apply during generation.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings
EditorsMichel Rueher
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783319449524
StatePublished - 1 Jan 2016
Event22nd International Conference on Principles and Practice of Constraint Programming, CP 2016 - Toulouse, France
Duration: 5 Sep 20169 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9892 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference22nd International Conference on Principles and Practice of Constraint Programming, CP 2016

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Breaking symmetries in graphs: The nauty way'. Together they form a unique fingerprint.

Cite this