Covering many (or few) edges with \(k\) vertices in sparse graphs (Q6490988)
From MaRDI portal
scientific article; zbMATH DE number 7836609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering many (or few) edges with \(k\) vertices in sparse graphs |
scientific article; zbMATH DE number 7836609 |
Statements
Covering many (or few) edges with \(k\) vertices in sparse graphs (English)
0 references
23 April 2024
0 references
parameterized complexity
0 references
kernelization
0 references
partial vertex cover
0 references
densest \(k\)-subgraph
0 references
Max \((k
0 references
n-k)\)-cut
0 references
degeneracy
0 references
