A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs |
scientific article |
Statements
A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (English)
0 references
19 April 2010
0 references
densest \(k\)-subgraph
0 references
chordal graphs
0 references
approximation algorithms
0 references
