Dynamic Graphs in the Sliding-Window Model

DOI10.1007/978-3-642-40450-4_29zbMath1395.68207OpenAlexW176067329MaRDI QIDQ2849326

Andrew McGregor, Daniel M. Stubbs, Michael S. Crouch

Publication date: 17 September 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams ⋮ Maximum Matching in Turnstile Streams ⋮ Unnamed Item ⋮ Graph sketching and streaming: new approaches for analyzing massive graphs ⋮ Succinct summing over sliding windows ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. ⋮ Structural results on matching estimation with applications to streaming ⋮ Derandomization for sliding window algorithms with strict correctness ⋮ Almost-smooth histograms and sliding-window graph algorithms

This page was built for publication: Dynamic Graphs in the Sliding-Window Model