Distributed Maximal Independent Set using Small Messages
From MaRDI portal
Publication:5236233
DOI10.1137/1.9781611975482.50zbMath1431.68132OpenAlexW4255054927MaRDI QIDQ5236233
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://doi.org/10.1137/1.9781611975482.50
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (10)
Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ Time-optimal construction of overlay networks ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Distributed MIS with Low Energy and Time Complexities ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Unnamed Item ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Distributed Lower Bounds for Ruling Sets
This page was built for publication: Distributed Maximal Independent Set using Small Messages
