Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:appearsIn |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:application |
gptkb:network_protocol
coding theory resource allocation scheduling |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a graph, find the largest set of vertices such that no two are adjacent.
|
| 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 |
maximum independent set
size of independent set |
| gptkbp:relatedTo |
gptkb:clique_problem
gptkb:vertex_cover_problem graph edge vertex stable set problem |
| gptkbp:solvedBy |
heuristics
approximation algorithms exact algorithms |
| gptkbp:bfsParent |
gptkb:Clique_problem
gptkb:Vertex_cover_problem |
| gptkbp:bfsLayer |
6
|