Weak graph colorings: distributed algorithms and applications

@inproceedings{Kuhn2009WeakGC,
  title={Weak graph colorings: distributed algorithms and applications},
  author={Fabian Kuhn},
  booktitle={SPAA '09},
  year={2009}
}
  • F. Kuhn
  • Published in SPAA '09 11 August 2009
  • Mathematics, Computer Science
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a color class may induce a graph of maximum degree d for some parameter d>0. We also look at colorings where a minimum number of multi-chromatic edges is required. For an integer k>0, we call a coloring k-partially proper if every node v has at least min{k,deg(v)} neighbors with a different color. We show that for all d∈{1… 
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
TLDR
New distributed algorithms to find (Δ/k)-coloring in graphs of girth 4 (triangle-free graphs), girth 5, and trees, where k is at most k, and o(1) is a function of Δ, are given.
Distributed Graph Coloring Made Easy
TLDR
A deterministic CONGEST algorithm to compute an O(kΔ)-vertex coloring in O( Δ/k)+łog^* n rounds, where Δ is the maximum degree of the network graph and 1łeq kłeq O(Δ) can be freely chosen.
Distributed deterministic edge coloring using bounded neighborhood independence
TLDR
A significantly faster deterministic edge-coloring algorithm that outperforms all the existing randomized algorithms for this problem and improves it exponentially in a wide range of Δ, specifically, for 2©(log* n) ≤ Δ ≤ polylog(n).
Distributed coloring algorithms for triangle-free graphs
TLDR
This paper gives new distributed algorithms to find ( Δ / k ) -coloring in graphs of girth 4 (triangle-free graphs), girth 5, and trees, and shows that the chromatic number of triangle-free graph classes can be much smaller.
D S ] 2 3 A ug 2 01 7 Distributed Coloring for Everywhere Sparse Graphs
Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with ∆+1 colors, where ∆ denotes the maximum degree. Using ∆
Near-Optimal Distributed Degree+1 Coloring
TLDR
A randomized distributed algorithm for D1LC that is optimal under plausible assumptions about the deterministic complexity of the problem is given, and this paper incorporates results from the technical report [HNT21] needed for a Congest implementation, which will be published separately later.
Local Conflict Coloring
TLDR
This work introduces conflict coloring as a general symmetry-breaking task that includes all the aforementioned tasks as specific instantiations - conflict coloring includes all locally checkable labeling tasks from [Naor & Stockmeyer, STOC 1993] and yields an LCA which requires a smaller number of probes than the previously best known algorithm for vertex-coloring.
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
TLDR
This article devise a deterministic algorithm that employs Δ1+o(1) colors, and runs in polylogarithmic time, and produces an O(a1+η)-coloring, for an arbitrarily small constant η > 0, in time O(log a log n).
Graph Coloring
We define ∆ to be the maximal degree of any vertex of G. • q ≥ ∆ + 1 =⇒ ∃ a coloring of G. We can see this by simply choosing a color for each vertex in some fixed order, and at every step there is
Distributed deterministic edge coloring using bounded neighborhood independence
TLDR
The main technical contribution is a subroutine that computes an O(Δ/p)-defective p-vertex coloring of graphs with bounded neighborhood independence in O(p2) + log* n time, for a parameter p, 1 ≤ p ≤ Δ.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
On the complexity of distributed graph coloring
TLDR
This paper proves new strong lower bounds for two special kinds of coloring algorithms, and proves a time lower bound of Ω(Δ/log<sup>2</sup> Δ+ log*<i>m</i>) to obtain an <i>O</i>(Δ)-coloring.
Locality based graph coloring
TLDR
A randomized algorithm for the problem of locality based graph coloring is designed and an upper bound of O(A. 2A log log n) is proved and lower bounds that match the upper bounds within a factor that is poly-logarithmic are obtained.
Distributed coloring in O~(⎷(log n)) bit rounds
TLDR
For the cycle in which all edges have the same orientation, it is shown that a simple randomized algorithm can achieve a 3-coloring with only O(√log n) rounds of bit transmissions, with high probability, and the bit complexity of coloring an oriented cycle is Ω( ∼log n), with high likelihood, no matter how many colors are allowed.
Defective coloring revisited
A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of such
Fast distributed graph coloring with O(Δ) colors
We consider the problem of deterministic distributed coloring of an n-vertex graph with maximum degree Δ, assuming that every vertex knows a priori only its own label and parameters n and Δ. The aim
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
TLDR
This work considers the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color, and shows that for the n-node cycle the bit complexity of the coloring problem is Omega(log n).
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
TLDR
It is proved that, for each compact surface S, there is an integer k = k(S) such that every graph in S can be (4, k)-colored; the conjecture that 4 can be replaced by 3 in this statement is conjecture.
On the Complexity of Distributed Network Decomposition
In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. As
Distributed (δ+1)-coloring in linear (in δ) time
TLDR
A deterministic (Δ + 1)-coloring distributed algorithm with running time O(Δ) + 1/2 log* n is presented, which breaks the heuristic barrier of Szegedy and Vishwanathan, and achieves running time which is linear in the maximum degree Δ.
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
TLDR
The first sublogarithmic algorithm for computing an MIS on graphs of bounded arboricity is devised, which demonstrates that this methodology is very powerful and shows nearly-tight lower bounds on the running time of any distributed algorithms for computing a forests-decomposition.
...
1
2
3
...