| Information | |
|---|---|
| has gloss | eng: 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". |
| lexicalization | eng: clique cover |
| instance of | c/Computational problems in graph theory |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint