Breaking Symmetries in Graph Representation

Codish, M., Miller, A. , Prosser, P. and Stuckey, A. (2013) Breaking Symmetries in Graph Representation. In: International Joint Conference on Artificial Intelligence, Beijing, China, 3-9 Aug 2013,

[img]
Preview
Text
78605.pdf - Accepted Version

560kB

Publisher's URL: https://dl.acm.org/citation.cfm?id=2540203

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.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick and Miller, Dr Alice
Authors: Codish, M., Miller, A., Prosser, P., and Stuckey, A.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2013 ACM
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record