Finding densest \(k\)-connected subgraphs (Q2235249)
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 densest k-connected subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding densest \(k\)-connected subgraphs |
scientific article |
Statements
Finding densest \(k\)-connected subgraphs (English)
0 references
21 October 2021
0 references
dense subgraph discovery
0 references
densest subgraph problem
0 references
connectivity
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0.878251314163208
0 references
0.839171290397644
0 references
0.8383060693740845
0 references
0.8240406513214111
0 references
0.8088833689689636
0 references
