Finding densest \(k\)-connected subgraphs (Q2235249)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
