A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:22, 30 January 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