Towards the Locality of Vizing's Theorem

01/02/2019
by   Hsin-Hao Su, et al.
0

Vizing showed that it suffices to color the edges of a simple graph using Δ + 1 colors, where Δ is the maximum degree of the graph. However, up to this date, no efficient distributed edge-coloring algorithms are known for obtaining such a coloring, even for constant degree graphs. The current algorithms that get closest to this number of colors are the randomized (Δ + Θ̃(√(Δ)))-edge-coloring algorithm that runs in polylog(n) rounds by Chang et al. (SODA '18) and the deterministic (Δ + polylog(n))-edge-coloring algorithm that runs in poly(Δ, n) rounds by Ghaffari et al. (STOC '18). We present two distributed edge-coloring algorithms that run in poly(Δ, n) rounds. The first algorithm, with randomization, uses only Δ+2 colors. The second algorithm is a deterministic algorithm that uses Δ+ O( n/ n) colors. Our approach is to reduce the distributed edge-coloring problem into an online, restricted version of balls-into-bins problem. If ℓ is the maximum load of the bins, our algorithm uses Δ + 2ℓ - 1 colors. We show how to achieve ℓ = 1 with randomization and ℓ = O( n / n) without randomization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2020

A Fast Distributed Algorithm for (Δ+ 1)-Edge-Coloring

We present a deterministic distributed algorithm in the LOCAL model that...
research
09/21/2018

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...
research
04/11/2019

Locality of not-so-weak coloring

Many graph problems are locally checkable: a solution is globally feasib...
research
11/15/2017

Deterministic Distributed Edge-Coloring with Fewer Colors

We present a deterministic distributed algorithm, in the LOCAL model, th...
research
10/30/2020

Online Edge Coloring Algorithms via the Nibble Method

Nearly thirty years ago, Bar-Noy, Motwani and Naor [IPL'92] conjectured ...
research
05/11/2023

Streaming Edge Coloring with Subquadratic Palette Size

In this paper, we study the problem of computing an edge-coloring in the...
research
07/13/2023

Edge-Coloring Algorithms for Bounded Degree Multigraphs

In this paper, we consider algorithms for edge-coloring multigraphs G of...

Please sign up or login with your details

Forgot password? Click here to reset