Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract) (Q4914440)
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: Exact and approximation algorithms for densest k-subgraph (extended abstract) |
scientific article; zbMATH DE number 6153628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract) |
scientific article; zbMATH DE number 6153628 |
Statements
Exact and Approximation Algorithms for Densest k-Subgraph (English)
0 references
12 April 2013
0 references
0.952426016330719
0 references
0.8693723082542419
0 references
0.8626871705055237
0 references
0.8468996286392212
0 references
0.8437157869338989
0 references
