TY - GEN
T1 - Breaking symmetries in graph representation
AU - Codish, Michael
AU - Miller, Alice
AU - Prosser, Patrick
AU - Stuckey, Peter J.
PY - 2013/12/1
Y1 - 2013/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84896062232&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84896062232
SN - 9781577356332
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 510
EP - 516
BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
T2 - 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
Y2 - 3 August 2013 through 9 August 2013
ER -