Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:approximationHardness |
hard to approximate within n^(1-ε)
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:decision |
Does a graph contain an independent set of size k?
|
| gptkbp:defines |
Given a graph, find the largest set of vertices with no two adjacent.
|
| gptkbp:describedBy |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:estimatedCost |
yes
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstDescribed |
1972
|
| https://www.w3.org/2000/01/rdf-schema#label |
Independent set problem
|
| gptkbp:input |
graph
|
| gptkbp:output |
independent set
|
| gptkbp:relatedTo |
gptkb:clique_problem
gptkb:vertex_cover_problem gptkb:maximum_clique_problem combinatorial optimization graph edge vertex maximum independent set |
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|