|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:application
|
computational chemistry
bioinformatics
network analysis
social network analysis
|
|
gptkbp:approximation
|
hard to approximate
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:decision
|
true
|
|
gptkbp:defines
|
Given a graph G and integer k, does G contain a clique of size k or more?
|
|
gptkbp:field
|
computer science
graph theory
|
|
gptkbp:firstProvedNPCompleteBy
|
gptkb:Richard_Karp
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Clique problem
|
|
gptkbp:includedIn
|
gptkb:Karp's_21_NP-complete_problems
|
|
gptkbp:input
|
graph
integer k
|
|
gptkbp:optimizedFor
|
gptkb:maximum_clique_problem
|
|
gptkbp:output
|
yes/no
|
|
gptkbp:reduces
|
gptkb:independent_set_problem
gptkb:vertex_cover_problem
|
|
gptkbp:reducibleFrom
|
gptkb:3-satisfiability
|
|
gptkbp:relatedTo
|
gptkb:clique_(graph_theory)
gptkb:maximum_clique_problem
gptkb:subgraph_isomorphism_problem
NP-complete problem
graph coloring problem
|
|
gptkbp:yearNPCompletenessProved
|
1972
|
|
gptkbp:bfsParent
|
gptkb:NP-completeness
|
|
gptkbp:bfsLayer
|
5
|