|
gptkbp:instanceOf
|
gptkb:theoretical_computer_science
|
|
gptkbp:approximation
|
hard to approximate
|
|
gptkbp:category
|
gptkb:graph
combinatorial optimization
|
|
gptkbp:complementGraphRelation
|
maximum independent set problem
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:decision
|
gptkb:clique_problem
|
|
gptkbp:defines
|
Given a graph, the problem of finding the largest clique (a subset of vertices such that every two vertices are connected by an edge).
|
|
gptkbp:famousAlgorithm
|
gptkb:Carraghan–Pardalos_algorithm
gptkb:Robson's_algorithm
gptkb:Bron–Kerbosch_algorithm
|
|
gptkbp:field
|
computer science
graph theory
|
|
gptkbp:formedBy
|
1970s
|
|
gptkbp:hardness
|
gptkb:NP-hard
|
|
gptkbp:input
|
gptkb:graph
|
|
gptkbp:optimizedFor
|
gptkb:maximum_clique_problem
|
|
gptkbp:output
|
largest clique
|
|
gptkbp:relatedTo
|
gptkb:clique
gptkb:vertex_cover_problem
gptkb:graph
gptkb:NP-complete_problem
graph coloring problem
maximum independent set problem
|
|
gptkbp:solvedBy
|
heuristics
approximation algorithms
exact algorithms
|
|
gptkbp:usedIn
|
coding theory
computational chemistry
computer vision
bioinformatics
social network analysis
|
|
gptkbp:bfsParent
|
gptkb:Clique_problem
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
maximum clique problem
|