Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:application |
gptkb:Bioinformatics
Network security Resource allocation |
| gptkbp:approximation_algorithm |
2-approximation exists
|
| gptkbp:complement |
Maximum independent set
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:decision_problem |
Does a graph have a vertex cover of size k?
|
| gptkbp:definedIn |
A set of vertices such that every edge in the graph is incident to at least one vertex in the set
|
| gptkbp:field |
gptkb:Graph_theory
Computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Vertex cover
|
| gptkbp:input |
Undirected graph
|
| gptkbp:König's_theorem |
In bipartite graphs, size of minimum vertex cover equals size of maximum matching
|
| gptkbp:minimum_vertex_cover |
Smallest possible vertex cover in a graph
|
| gptkbp:NP-complete |
Yes
|
| gptkbp:output |
Set of vertices
|
| gptkbp:parameterized_complexity |
Fixed-parameter tractable for parameter k
|
| gptkbp:relatedTo |
gptkb:Clique
Edge cover Independent set |
| gptkbp:studiedBy |
gptkb:King
|
| gptkbp:used_in |
gptkb:Social_network_analysis
Scheduling VLSI design Network design Facility location |
| gptkbp:bfsParent |
gptkb:Hitting_Set
|
| gptkbp:bfsLayer |
7
|