Practical parallel algorithms for near-optimal densest subgraphs on massive graphs

DOI10.1137/1.9781611977929.5MaRDI QIDQ6545384zbMATH OpenFDO

Authors Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun

Publication date 29 May 2024

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• On solving the densest \(k\)-subgraph problem on large graphs
• Finding Dense Subgraphs with Size Bounds
• Densest subgraph in dynamic graph streams
• Discounted average degree density metric and new algorithms for the densest subgraph problem

This page was built for publication: Practical parallel algorithms for near-optimal densest subgraphs on massive graphs

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