Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
A clique cover of a graph is a set of cliques such that every edge of the graph belongs to at least one of the cliques.
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Clique Cover
|
| gptkbp:introducedIn |
mathematical literature on graph theory
|
| gptkbp:minimumCliqueCover |
the smallest number of cliques needed to cover all edges of a graph
|
| gptkbp:notation |
clique cover number (cc(G))
|
| gptkbp:relatedTo |
gptkb:clique
edge coloring chromatic number vertex cover clique partition set cover problem |
| gptkbp:usedIn |
computational biology
network security social network analysis |
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972) |
| gptkbp:bfsLayer |
6
|