A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2008.03.016 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2008.03.016 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 10 December 2024
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
