Vertex and Hyperedge Connectivity in Dynamic Graph Streams
Summary: First linear-sketch algorithms for estimating vertex connectivity in dynamic graph streams and for constructing hypergraph sparsifiers, tackling vertex-connectivity’s different and harder combinatorial structure versus edge connectivity. Generalizes Ahn et al.’s graph sparsification to hypergraphs, simplifies prior streaming constructions, and introduces a generalized graph degeneracy notion to extend subgraph-reconstruction techniques (Becker et al.). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sudipto Guha
- 2. Andrew McGregor
- 3. David Tench
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,020 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 6.5237459e-05 |
| 7,145 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 4.8179617e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |
| 1,094 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00014129658 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,321 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1945683e-05 |
| 7,769 | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams | 2022 | SIGMOD | 4.6562896e-05 |
| 10,123 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 4.1945683e-05 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 5,949 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD | 5.2595857e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.3849295e-05 |
| 4,900 | Graph Synopses, Sketches, and Streams: A Survey | 2012 | VLDB | 5.8423536e-05 |
| 1,472 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 0.00011828662 |
| 1,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |