Densest \(k\)-subgraph approximation on intersection graphs (Q3075452)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5851822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Densest \(k\)-subgraph approximation on intersection graphs |
scientific article; zbMATH DE number 5851822 |
Statements
Densest k-Subgraph Approximation on Intersection Graphs (English)
0 references
15 February 2011
0 references
0.8510597348213196
0 references
0.8361191153526306
0 references
0.8298717737197876
0 references
0.827849805355072
0 references
0.8254760503768921
0 references
