On the lengths of symmetry breaking-preserving games on graphs.
Frank HararyWolfgang SlanyOleg VerbitskyPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- symmetry breaking
- constraint programming
- boolean satisfiability
- search tree
- constraint satisfaction problems
- global constraints
- integer linear programming
- graph coloring
- video games
- symmetry breaking constraints
- computational complexity
- boolean optimization
- game playing
- graph model
- constraint propagation
- sat solvers
- orders of magnitude
- np complete
- simulated annealing
- worst case
- knowledge representation