Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds

@article{Panconesi1997RandomizedDE,
  title={Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds},
  author={Alessandro Panconesi and Aravind Srinivasan},
  journal={SIAM J. Comput.},
  year={1997},
  volume={26},
  pages={350-368}
}
Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring problems. We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation. Our algorithms compute an edge coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $1.6 \Delta + O(\log^{1+ \delta} n)$ colors with high probability (arbitrarily close to 1) for any fixed… Expand
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 ≤ Δ. Expand
Faster Deterministic Distributed Coloring Through Recursive List Coloring
  • F. Kuhn
  • Computer Science, Mathematics
  • SODA
  • 2020
TLDR
An improved deterministic $2^{O(\sqrt{\log\Delta})}\cdot\log^3 n$-round algorithm for $\Delta$-coloring non-complete graphs with maximum degree $\Delta\geq 3$. Expand
The Complexity of Distributed Edge Coloring with Small Palettes
TLDR
A randomized edge coloring algorithm that can use palette sizes as small as $\Delta + \tilde{O}(\sqrt{\Delta})$, which is a natural barrier for randomized approaches. Expand
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). Expand
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
TLDR
Deterministic edge-coloring algorithms that employ only Δ + o(Δ) colors, for a very wide family of graphs, and for any value κ in the range [4Δ, 2o(log Δ) ⋅ Δ], the current paper has smaller running time than the best previously-known κ-edge-colored algorithms. Expand
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma
TLDR
A new distributed Lovász local lemma algorithm for tree-structured dependency graphs, which arise naturally from O(1)-round probabilistic algorithms run on trees, is developed and shown that the Ω (logΔ log n) lower bound can be nearly matched on trees. Expand
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
TLDR
It is shown that a (2Δ − 1)-edge-coloring can be computed in time smaller than loge n for any e > 0, specifically, in eO([EQUATION]log log n) rounds. Expand
Deterministic Distributed (∆ + o(∆))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of theExpand
The Local Nature of List Colorings for Graphs of High Girth
TLDR
The algorithm can compute k-list vertex colorings of graphs having girth larger than clogk-1n and exhibit a certain degree of "locality", which is exploited to obtain an efficient distributed algorithm able to compute both kinds of optimal list colorings. Expand
Distributed Degree Splitting, Edge Coloring, and Orientations
TLDR
It is shown that sinkless orientation exhibits an exponential separation between its randomized and deterministic complexities, akin to the results of Chang et al. for Δ-coloring Δ-regular trees. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Fast randomized algorithms for distributed edge coloring
TLDR
The results extend the Chernoff-Hoeffding bounds to certain types of random variables which are not stochastic ally independent, and believe that these results are of independent interest, and merit further study. Expand
Improved distributed algorithms for coloring and network decomposition problems
TLDR
It is shown that A-coloring G is reducible in 0(log3 n/log A) time to (A+ I)-vertex coloring G in a distributed model, which leads to fast distributed algorithms, and a linear–processor NC algorithm, for Acoloring. Expand
Efficient Parallel Algorithms for Edge Coloring Problems
TLDR
This paper gives NC algorithms for coloring multigraphs with 3[ Δ 2 ] colors and simple graphs which have Δ = O(logO(1)n) with Δ + 1 colors, and presents a randomized NC algorithm that colors arbitrary simple graphs withΔ + O(Δ ( 1 2 +ϵ) colors. Expand
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
TLDR
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data. Expand
Near-Optimal Distributed Edge Coloring
TLDR
A distributed randomized algorithm to edge color a network is given and colours G with (1+λ)Δ colours in time O(log n) are given. Expand
Chernoff-Hoeffding bounds for applications with limited independence
TLDR
The limited independence result implies that a reduced amount and weaker sources of randomness are sufficient for randomized algorithms whose analyses use the CH bounds, e.g., the analysis of randomized algorithms for random sampling and oblivious packet routing. Expand
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting
TLDR
This research addresses the problem of sorting n integers each in the range {0, ..., m - 1} in parallel on the PRAM model of computation and gives randomized algorithms that run in O(1) time using n processors, whenever m is not too close to n. Expand
Simulating (logcn)-wise independence in NC
TLDR
A general framework for removing randomness from randomized NC algorithms whose analysis uses only polyalgorithmic independence is developed, which can be used to obtain many other NC algorithms, including a better NC edge coloring algorithm. Expand
Removing randomness in parallel computation without a processor penalty
  • M. Luby
  • Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
A parallel algorithm for the Delta +1 vertex coloring problem with running time O(log/sup 3/ nlog log n) using a linear number of processors on a concurrent-read-concurrent-write parallel random-access machine. Expand
A fast parallel algorithm for routing in permutation networks
An algorithm is given for routing in permutation networks-that is, for computing the switch settings that implement a given permutation. The algorithm takes serial time <i>O</i>(<i>n</i>(logExpand
...
1
2
3
...