Densest subgraph: supermodularity, iterative peeling, and flow

DOI10.1137/1.9781611977073.64MaRDI QIDQ6575138zbMATH OpenFDO

Authors Chandra Chekuri, Kent Quanrud, Manuel Torres

Publication date 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Densest subgraph: supermodularity, iterative peeling, and flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575138)