Distributed large independent sets in one round on bounded-independence graphs
From MaRDI portal
Publication:1664165
DOI10.1007/978-3-662-48653-5_37zbMath1394.68429OpenAlexW2294280173MaRDI QIDQ1664165
Christian Konrad, Magnús M. Halldórsson
Publication date: 24 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_37
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 (3)
Distributed independent sets in interval and segment intersection graphs ⋮ On the Microscopic View of Time and Messages ⋮ When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
This page was built for publication: Distributed large independent sets in one round on bounded-independence graphs
