The densest \(k\)-subgraph problem on clique graphs (Q2426654)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The densest \(k\)-subgraph problem on clique graphs |
scientific article |
Statements
The densest \(k\)-subgraph problem on clique graphs (English)
0 references
23 April 2008
0 references
Clique graph
0 references
Polynomial time approximation scheme
0 references
Dynamic programming
0 references
0 references
