Symmetry breaking in graceful graphs

Petrie, Karen E. and Smith, Barbara M. (2004) Symmetry breaking in graceful graphs. In: Principles and Practice of Constraint Programming – CP 2003. Lecture Notes in Computer Science, 2833/2 . Springer Berlin, Heidelberg, pp. 930-934. ISBN 978-3-540-20202-8

Metadata only available from this repository.

Abstract

Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs). For instance, in 3-colouring the nodes of a graph, a CSP model that assigns a specific colour to each node has sets of equivalent solutions in which the three colours are permuted. Symmetry in CSPs can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered. If a partial assignment does not lead to a solution, neither will any symmetrically equivalent assignment. When searching for all solutions, for every solution found, all the symmetrically equivalent solutions will also be found

Item Type:	Book Chapter
Subjects:	T Technology > T Technology (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools:	School of Computing and Engineering
Depositing User:	Briony Heyhoe
Date Deposited:	27 Aug 2008 08:05
Last Modified:	27 Aug 2008 08:05
URI:	http://eprints.hud.ac.uk/id/eprint/1630

Downloads

Repository Staff Only: item control page

View Item