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 this page instead for the normal view: Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset |
scientific article |
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
