The densest subgraph problem in sparse random graphs (Q259578): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1555111922 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The densest subgraph problem in sparse random graphs |
scientific article |
Statements
The densest subgraph problem in sparse random graphs (English)
0 references
11 March 2016
0 references
maximum subgraph density
0 references
load balancing
0 references
local weak convergence
0 references
objective method
0 references
unimodularity
0 references
pairing model
0 references
0 references
0 references
