Parameterized Complexity Results in Symmetry Breaking

09/06/2010
by   Toby Walsh, et al.
0

Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into that intractability and help identify special cases in which symmetry can be dealt with more tractably

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset