A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021294212 / rank | |||
Normal rank | |||
Revision as of 21:59, 19 March 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
