Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity |
scientific article |
Statements
Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (English)
0 references
11 May 2021
0 references
graph mining
0 references
graph algorithms
0 references
densest subgraph
0 references
approximation algorithms
0 references
computational complexity
0 references
0 references
