{"type":"ScholarlyArticle","title":"Breaking Symmetries in Graph Representation","authors":[{"name":"Michael Codish","slug":"michael-codish","given":"Michael","family":"Codish","affiliation":""},{"name":"Alice Miller","slug":"alice-miller","given":"Alice","family":"Miller","affiliation":""},{"name":"Patrick Prosser","slug":"patrick-prosser","given":"Patrick","family":"Prosser","affiliation":""},{"name":"Peter J. Stuckey","slug":"peter-j-stuckey","given":"Peter J.","family":"Stuckey","affiliation":""}],"abstract":"There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution. In this paper we introduce novel, effective and compact, symmetry breaking constraints for undirected graph search. While incomplete, these prove highly beneficial in pruning the search for a graph. We illustrate the application of symmetry breaking in graph representation to resolve several open instances in extremal graph theory.","doi":null,"url":"https://ijcai.org/proceedings/2013/83","pdf":"https://ijcai.org/proceedings/2013/0083.pdf","markdown":"https://ijcai.org/proceedings/2013/83.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/83","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":83,"pages":{"first":510,"last":515},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}