Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model
Summary: First super-polylogarithmic deterministic lower bound for distributed sketching: deciding k-edge connectivity requires Ω(k)-bit messages for superconstant k≤√n. Introduces UniqueOverlap, cross-intersecting-family hardness, and an error-free simulation argument. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Peter Robinson (Augusta University)
- 2. Ming Ming Tan (Augusta University)
BibTeX Citation
@inproceedings{robinson_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model}},
url = {https://dl.acm.org/doi/10.1145/3801897},
doi = {10.1145/3801897},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Robinson, Peter and Tan, Ming Ming},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00011984702 |
| 4,739 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS | 6.5285049e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,370 | Node-Differentially Private Estimation of the Number of Connected Components | 2023 | PODS |
| 2 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 3 | 6,345 | Clustering Uncertain Graphs | 2018 | VLDB |
| 4 | 7,144 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB |
| 5 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 6 | 9,032 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB |
| 7 | 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 8 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 9 | 5,996 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS |
| 10 | 11,125 | Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut | 2024 | PODS |