Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

DOI10.1137/1.9781611975482.111zbMath1432.68165arXiv1807.05135OpenAlexW4230075666MaRDI QIDQ5236295

Jelani Nelson, Huacheng Yu

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05135

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

This page was built for publication: Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation