Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| 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:hasApplication |
bioinformatics
network analysis social network analysis |
| gptkbp:hasProperty |
minimum clique cover is the smallest number of cliques needed to cover all edges
|
| gptkbp:relatedTo |
gptkb:clique
gptkb:graph gptkb:NP-complete_problem chromatic number vertex cover edge cover intersection graph covering clique cover number |
| gptkbp:usedIn |
gptkb:combinatorics
gptkb:theoretical_computer_science |
| gptkbp:bfsParent |
gptkb:clique_(graph_theory)
gptkb:Clique_Partition |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
clique cover
|