Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition

DOI10.1145/1400751.1400757zbMath1301.05327MaRDI QIDQ2934329

Michael Elkin, Leonid Barenboim

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1400751.1400757

zbMATH Keywords

coloring; arboricity; MIS; \textsc{Maximal Independent Set}; forests decomposition

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68M14: Distributed systems

68W15: Distributed algorithms

Related Items

Distributed Graph Algorithms and their Complexity: An Introduction, Distributed deterministic edge coloring using bounded neighborhood independence, Symmetry breaking depending on the chromatic number or the neighborhood growth, A fast network-decomposition algorithm and its applications to constant-time distributed computation, Combinatorial algorithms for distributed graph coloring, On the complexity of distributed graph coloring with local minimality constraints, Combinatorial Algorithms for Distributed Graph Coloring, A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation