Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs |
scientific article; zbMATH DE number 6016048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs |
scientific article; zbMATH DE number 6016048 |
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
0 references
0.9007981419563292
0 references
0.8422766327857971
0 references
0.8376324772834778
0 references
0.8361191153526306
0 references
0.8301684856414795
0 references
