The densest subgraph problem in sparse random graphs (Q259578)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6554521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The densest subgraph problem in sparse random graphs |
scientific article; zbMATH DE number 6554521 |
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
0 references
0.8205505013465881
0 references
0.8200458884239197
0 references
0.8199261426925659
0 references
0.812685489654541
0 references
0.8125333189964294
0 references
