Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction
Peter Robinson, Ming Ming Tan
We present the first polynomial lower bounds for several fundamental problems in the distributed graph sketching model in the tiny-error regime, which includes deterministic algori…
cs.DS2025
Deterministic Lower Bounds for -Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
We study the -edge connectivity problem on undirected graphs in the distributed sketching model, where we have nodes and a referee. Each node sends a single message to the r…