Randomized Lower Bound for Distributed Spanning-Tree Verification
From MaRDI portal
Publication:5496155
DOI10.1007/978-3-319-09620-9_12zbMath1417.68161OpenAlexW1007786830MaRDI QIDQ5496155
Publication date: 7 August 2014
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_12
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)
This page was built for publication: Randomized Lower Bound for Distributed Spanning-Tree Verification
