Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2010.05.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2010.05.011 / rank | |||
Normal rank | |||
Revision as of 09:13, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs |
scientific article |
Statements
Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (English)
0 references
19 March 2012
0 references
densest subgraph
0 references
proper interval graph
0 references
bipartite permutation graph
0 references
approximation algorithms
0 references
0 references
