Sciweavers

Share
AMAI
2004
Springer

Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes

10 years 1 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is used to test the methods. But the technique can be extended to other problems. In particular Symmetry Breaking via Dominance Detection (SBDD) is applied to find Comma-Free Codes. To check if a current partial solution is symmetrically equivalent to a previously found no-good, graph isomorphism is used. In particular the powerful and fast graph isomorphism package nauty is used. Experimental results show that for
Justin Pearson
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where AMAI
Authors Justin Pearson
Comments (0)
books