Computing the \(k\) densest subgraphs of a graph (Q2094387)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the \(k\) densest subgraphs of a graph |
scientific article |
Statements
Computing the \(k\) densest subgraphs of a graph (English)
0 references
28 October 2022
0 references
algorithm design
0 references
network mining and analysis
0 references
densest subgraph
0 references
algorithmic aspects of networks
0 references
algorithms
0 references
0 references
0 references
0 references
