Clique-Width is NP-Complete.
Michael R. FellowsFrances A. RosamondUdi RoticsStefan SzeiderPublished in: SIAM J. Discret. Math. (2009)
Keyphrases
- np complete
- np hard
- satisfiability problem
- constraint satisfaction problems
- polynomially solvable
- conjunctive queries
- randomly generated
- computational complexity
- data complexity
- pspace complete
- phase transition
- fixed width
- database
- independent set
- maximum weight
- np complete problems
- sat problem
- data management
- optimal solution
- neural network
- databases