This paper deals with the problems of computing a maximal independent set and a vertex coloring in a dktributed model of computation.
... Computing. Improved distributed algorithms for coloring and network decomposition problems. Pages 581 - 592. PREVIOUS CHAPTER. Competitive distributed job ...
This paper presents faster distributed algorithms, in the LOCAL model, for computing a Δ -coloring of any non-clique graph with maximum degree Δ ≥ 3 . Moreover, ...
No information is available for this page. · Learn why
Title, Improved distributed algorithms for coloring and network decomposition problems. Publication Type, Conference Papers. Year of Publication, 1992.
Apr 2, 2020 · In this paper, we are therefore interested in distributed approximation algorithms for the minimum vertex coloring problem, which asks for a ...
Sep 23, 2022 · This paper presents significantly improved deterministic algorithms for some of the key problems in the area of distributed graph algorithms.
Graph G also constitutes the problem input. The goal of a distributed coloring algorithm is to compute a (global) coloring, where every node reports its color ...
[PDF] Improved Distributed Network Decomposition, Hitting Sets, and ...
par.nsf.gov › servlets › purl
In this paper, we focus on two of the most central tools in developing deterministic algorithms for local graph problems, namely network decompositions and ...
This paper presents significantly improved deterministic algorithms for some of the key problems in the area of distributed graph algorithms.