Finding connected \(k\)-subgraphs with high density (Q2407097)
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: Finding connected k-subgraphs with high density |
scientific article; zbMATH DE number 6782882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding connected \(k\)-subgraphs with high density |
scientific article; zbMATH DE number 6782882 |
Statements
Finding connected \(k\)-subgraphs with high density (English)
0 references
28 September 2017
0 references
densest \(k\)-subgraphs
0 references
heaviest \(k\)-subgraphs
0 references
connectivity
0 references
approximation algorithms
0 references
interval graphs
0 references
0 references
0 references
0 references
0.9279983639717102
0 references
0.839171290397644
0 references
0.8159576058387756
0 references
0.8038597702980042
0 references
0.7973506450653076
0 references
