Dense Subgraphs on Dynamic Networks

DOI10.1007/978-3-642-33651-5_11zbMath1377.68170arXiv1208.1454OpenAlexW1500483810MaRDI QIDQ4909408

Atish Das Sarma, Ashwin Lall, Amitabh Trehan, Danupon Nanongkai

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1454

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

This page was built for publication: Dense Subgraphs on Dynamic Networks