Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
Maximum Independent Vertex Set
|
| gptkbp:approximation |
hard to approximate within any constant factor for general graphs
|
| gptkbp:complementaryProblem |
maximum clique
minimum vertex cover |
| gptkbp:complexity |
gptkb:NP-hard
W[1]-complete |
| gptkbp:decision |
Given a graph G and integer k, does G have an independent set of size at least k?
|
| gptkbp:defines |
An independent set of maximum possible size in a graph
|
| gptkbp:exactAlgorithm |
exponential time algorithms exist
|
| gptkbp:hasSpecialCase |
polynomial time solvable for bipartite graphs
polynomial time solvable for trees |
| https://www.w3.org/2000/01/rdf-schema#label |
Maximum Independent Set
|
| gptkbp:optimizationProblem |
Find the largest independent set in a given graph
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:stable_set_polytope gptkb:clique_problem gptkb:Turán's_theorem gptkb:Lovász_Local_Lemma combinatorial optimization graph theory graph coloring independent set planar graphs greedy algorithm randomized algorithms vertex random graphs approximation algorithms vertex cover maximum matching branch and bound NP-hard problem perfect graphs interval graphs linear programming relaxation chordal graphs fixed-parameter tractable algorithms independent dominating set induced subgraph vertex packing |
| gptkbp:studiedBy |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:usedIn |
gptkb:network_protocol
coding theory resource allocation scheduling social network analysis |
| gptkbp:bfsParent |
gptkb:Vertex_Cover
|
| gptkbp:bfsLayer |
7
|