Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:algorithmic_problem |
finding all cliques in a graph
|
| gptkbp:definedIn |
a subset of vertices of an undirected graph such that every two distinct vertices are adjacent
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
clique
|
| gptkbp:NP-complete_problem |
gptkb:clique_decision_problem
gptkb:maximum_clique_problem |
| gptkbp:relatedConcept |
graph
maximal clique maximum clique |
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:Erdős–Rényi_model gptkb:Bron–Kerbosch_algorithm gptkb:Turán's_theorem independent set chromatic number clique complex clique graph clique number clique-width quasi-clique vertex cover |
| gptkbp:used_in |
chemistry
computational biology computer science social network analysis |
| gptkbp:bfsParent |
gptkb:Ramsey_number
gptkb:Graph_theory |
| gptkbp:bfsLayer |
5
|