clique problem (optimization version)
GPTKB entity
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
coding theory
computational chemistry bioinformatics social network analysis |
| gptkbp:approximation |
hard to approximate within n^(1-ε) for any ε>0 unless P=NP
|
| gptkbp:category |
combinatorial optimization
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
Given a graph, find the largest clique (complete subgraph) in the graph.
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
clique problem (optimization version)
|
| gptkbp:input |
graph
|
| gptkbp:output |
maximum clique size
vertices of the maximum clique |
| gptkbp:relatedTo |
gptkb:independent_set_problem
gptkb:vertex_cover_problem gptkb:maximum_clique_problem clique problem (decision version) |
| gptkbp:solvedBy |
approximation algorithms
heuristic algorithms exact algorithms |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|