clique cover

English Wikipedia - The Free Encyclopedia

Download this dictionary

Clique cover problem

In computational complexity theory, finding a minimum clique cover is a graph-theoretical NP-complete problem. The problem was one of Richard Karp's original 21 problems shown NP-complete in his 1972 paper "Reducibility Among Combinatorial Problems".

See more at Wikipedia.org...

© This article uses material from Wikipedia^® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License