Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset (Q3467871)
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 6539340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset |
scientific article; zbMATH DE number 6539340 |
Statements
Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (English)
0 references
5 February 2016
0 references
greedy approximation algorithm
0 references
polynomial time algorithm
0 references
0 references
0.8583419919013977
0 references
0.8441480994224548
0 references
0.8419891595840454
0 references
0.8388804197311401
0 references
0.8386305570602417
0 references
