3 papers
cs.DS2025
Fast and Compact Sketch-Based Dynamic Connectivity
Quinten De Man, Qamber Jafri, Daniel Delayo +3
We study the dynamic connectivity problem for massive, dense graphs. Our goal is to build a system for dense graphs that simultaneously answers connectivity queries quickly, mainta…
cs.DS2025
The Case for External Graph Sketching
Michael A. Bender, MartÃn Farach-Colton, Riko Jacob +3
Algorithms in the data stream model use space to compute some property of an input of size , and many of these algorithms are implemented and used in practice. H…
cs.DC2024
Exploring the Landscape of Distributed Graph Sketching
David Tench, Evan T. West, Kenny Zhang +6
Recent work has initiated the study of dense graph processing using graph sketching methods, which drastically reduce space costs by lossily compressing information about the input…