Computing the \(k\) densest subgraphs of a graph (Q2094387)
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: Computing the \(k\) densest subgraphs of a graph |
scientific article; zbMATH DE number 7609055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the \(k\) densest subgraphs of a graph |
scientific article; zbMATH DE number 7609055 |
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
0.9632368
0 references
0 references
0.9467913
0 references
0.94281226
0 references
0 references
0 references
0.93892604
0 references
0 references
0 references
