Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:describedYear |
1972
|
| gptkbp:field |
gptkb:complexity_theory
theoretical computer science graph theory |
| gptkbp:firstDescribed |
gptkb:Richard_Karp
gptkb:Karp's_21_NP-complete_problems |
| https://www.w3.org/2000/01/rdf-schema#label |
clique decision problem
|
| gptkbp:input |
graph
integer k |
| gptkbp:reduces |
gptkb:independent_set_problem
gptkb:vertex_cover_problem gptkb:maximum_clique_problem |
| gptkbp:relatedTo |
gptkb:clique_(graph_theory)
NP-complete problem |
| gptkbp:type |
Does the graph contain a clique of size k?
|
| gptkbp:bfsParent |
gptkb:clique
|
| gptkbp:bfsLayer |
6
|