AI Chat AI Image Generator AI Video Text to Speech

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

06/28/2020

∙

by Anton Bernshteyn, et al.

∙

∙

We present a deterministic distributed algorithm in the LOCAL model that finds a proper (Δ + 1)-edge-coloring of an n-vertex graph of maximum degree Δ in poly(Δ, log n) rounds. This is the first nontrivial distributed edge-coloring algorithm that uses only Δ+1 colors (matching the bound given by Vizing's theorem). Our approach is inspired by the recent proof of the measurable version of Vizing's theorem due to Grebík and Pikhurko.

page 1

page 2

page 3

page 4

research

∙ 01/02/2019

Towards the Locality of Vizing's Theorem

Vizing showed that it suffices to color the edges of a simple graph usin...

0 Hsin-Hao Su, et al. ∙

research

∙ 11/15/2017

Deterministic Distributed Edge-Coloring with Fewer Colors

We present a deterministic distributed algorithm, in the LOCAL model, th...

0 Mohsen Ghaffari, et al. ∙

research

∙ 06/30/2023

Borel Vizing's Theorem for Graphs of Subexponential Growth

We show that every Borel graph G of subexponential growth has a Borel pr...

0 Anton Bernshteyn, et al. ∙

research

∙ 06/07/2021

A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling Colorings

We show that the natural Glauber dynamics mixes rapidly and generates a ...

0 Dorna Abdolazimi, et al. ∙

research

∙ 09/21/2018

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...

0 Étienne Bamas, et al. ∙

research

∙ 07/13/2019

Cover and variable degeneracy

Let f be a nonnegative integer valued function on the vertex-set of a gr...

0 Fangyao Lu, et al. ∙

research

∙ 11/24/2010

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...

0 Hugo Hernández, et al. ∙