@inproceedings{6de75e9d710b45b78c6eaaef42d6c182,
title = "Breaking symmetries in graphs: The nauty way",
abstract = "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.",
author = "Michael Codish and Graeme Gange and Avraham Itzhakov and Stuckey, \{Peter J.\}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 22nd International Conference on Principles and Practice of Constraint Programming, CP 2016 ; Conference date: 05-09-2016 Through 09-09-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-44953-1\_11",
language = "American English",
isbn = "9783319449524",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "157--172",
editor = "Michel Rueher",
booktitle = "Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings",
address = "Germany",
}