Computing densest \(k\)-subgraph with structural parameters (Q2680362)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing densest \(k\)-subgraph with structural parameters |
scientific article |
Statements
Computing densest \(k\)-subgraph with structural parameters (English)
0 references
29 December 2022
0 references
densest subgraphs
0 references
sparsest subgraphs
0 references
fixed parameter tractability
0 references
structural parameters
0 references
approximation algorithm
0 references
0 references
0 references
