Filling Logarithmic Gaps in Distributed Complexity for Global Problems
From MaRDI portal
Publication:5175124
DOI10.1007/978-3-662-46078-8_31zbMath1432.68364OpenAlexW242735627MaRDI QIDQ5175124
Publication date: 20 February 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_31
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)
Related Items (2)
Low-congestion shortcut and graph parameters ⋮ Sparsifying Congested Cliques and Core-Periphery Networks
This page was built for publication: Filling Logarithmic Gaps in Distributed Complexity for Global Problems
