Graph sketching and streaming: new approaches for analyzing massive graphs
From MaRDI portal
Publication:2399360
DOI10.1007/978-3-319-58747-9_4zbMath1489.68198OpenAlexW2611566349MaRDI QIDQ2399360
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_4
Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating the Caro-Wei bound for independent sets in graph streams
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Dynamic Graphs in the Sliding-Window Model
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Densest Subgraph in Dynamic Graph Streams
- Single Pass Spectral Sparsification in Dynamic Streams
- Estimating PageRank on graph streams
- Maximum Matching in Semi-streaming with Few Passes
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
- Streaming Algorithms for Independent Sets
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
- Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space
- On Estimating Maximum Matching Size in Graph Streams
- A Hybrid Sampling Scheme for Triangle Counting
- A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
- Planar Matching in Streams Revisited
- Tight Bounds for Graph Problems in Insertion Streams
- Tight bounds for single-pass streaming complexity of the set cover problem
This page was built for publication: Graph sketching and streaming: new approaches for analyzing massive graphs
