最小クリーク被覆問題
1. Clique cover problemIn 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". The clique cover problem (also sometimes called partition into cliques) is the problem of determining whether the vertices of a graph can be partitioned into k cliques.
Read “Clique cover problem” on English Wikipedia
Read “最小クリーク被覆問題” on Japanese Wikipedia
Read “Clique cover problem” on DBpedia
Read “Clique cover problem” on English Wikipedia
Read “最小クリーク被覆問題” on Japanese Wikipedia
Read “Clique cover problem” on DBpedia
Discussions
Log in to talk about this word.