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 (University of Pennsylvania)
- 2. Andrew McGregor (University of Massachusetts Amherst)
- 3. David Tench (University of Massachusetts Amherst)
BibTeX Citation
@inproceedings{guha_pods15,
address = {New York, NY, USA},
series = {{PODS} '15},
title = {{Vertex and Hyperedge Connectivity in Dynamic Graph Streams}},
url = {https://dl.acm.org/doi/10.1145/2745754.2745763},
doi = {10.1145/2745754.2745763},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Guha, Sudipto and McGregor, Andrew and Tench, David},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,668 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.1131403e-05 |
| 5,778 | Data Streams with Bounded Deletions | 2018 | PODS | 5.9977531e-05 |
| 7,849 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 5.4410785e-05 |
| 10,369 | Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model | 2026 | PODS | 4.9793485e-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 |
|---|---|---|---|---|
| 805 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00013794691 |
| 1,169 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00011726145 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,799 | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams | 2022 | SIGMOD |
| 2 | 10,603 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD |
| 3 | 758 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 4 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 5 | 5,730 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 6 | 9,474 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 7 | 10,806 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 8 | 4,788 | Graph Synopses, Sketches, and Streams: A Survey | 2012 | VLDB |
| 9 | 2,054 | Space Efficient Mining of Multigraph Streams | 2005 | PODS |
| 10 | 1,169 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |