Densest Subgraph in Dynamic Graph Streams
From MaRDI portal
Publication:2946417
DOI10.1007/978-3-662-48054-0_39zbMath1466.68062arXiv1506.04417OpenAlexW2260890852MaRDI QIDQ2946417
David Tench, Sofya Vorotnikova, Andrew McGregor, Hoa T. Vu
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04417
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20) Density (toughness, etc.) (05C42) Other nonclassical models of computation (68Q09)
Related Items (7)
Graph sketching and streaming: new approaches for analyzing massive graphs ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Revisiting maximum satisfiability and related problems in data streams ⋮ Single-pass streaming algorithms to partition graphs into few forests ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Optimality of linear sketching under modular updates ⋮ Better streaming algorithms for the maximum coverage problem
This page was built for publication: Densest Subgraph in Dynamic Graph Streams
