The densest subgraph problem in sparse random graphs
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | ISSN: 1050-5164 |
| Author | Anantharam, Venkat, Salez, Justin |
| Maintainer | CCSD |
| Last Updated | May 7, 2026, 19:17 (UTC) |
| Created | May 7, 2026, 19:17 (UTC) |
| Identifier | hal-00919079 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Department of Electrical Engineering and Computer Science [Berkeley] (EECS) ; University of California [Berkeley] (UC Berkeley) ; University of California (UC)-University of California (UC) |
| creator | Anantharam, Venkat |
| date | 2016-02-07T00:00:00 |
| harvest_object_id | 2988abdc-735c-462b-a8f8-71465c98edc0 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2026-04-01T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/arxiv/1312.4494 |
| set_spec | type:ART |