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".

单词	Clique cover problem
释义	Clique cover problem 英语百科 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".
随便看	Punta Punta Alta Punta Arenas puntaarenas puntabout Punta Cardón Punta de Bombón Punta del Este Punta Delgada Punta de los Llanos Punta de Vacas Punta Fijo Puntagorda Punta Gorda Punta Hidalgo Puntal Punta León Punta Negra Punta Negra, Salar de Punta Norte Punta Prieta Punta Prima Punta Raisi, Aeroporto de puntarella Puntarelle