Fast algorithms for Vizing's theorem on bounded degree graphs

03/09/2023
by   Anton Bernshteyn, et al.
0

Vizing's theorem states that every graph G of maximum degree Δ can be properly edge-colored using Δ + 1 colors. The fastest currently known (Δ+1)-edge-coloring algorithm for general graphs is due to Sinnamon and runs in time O(m√(n)), where n = |V(G)| and m =|E(G)|. Using the bound m ≤Δ n/2, the running time of Sinnamon's algorithm can be expressed as O(Δ n^3/2). In the regime when Δ is considerably smaller than n (for instance, when Δ is a constant), this can be improved, as Gabow, Nishizeki, Kariv, Leven, and Terada designed an algorithm with running time O(Δ m log n) = O(Δ^2 n log n). Here we give an algorithm whose running time is only linear in n (which is obviously best possible) and polynomial in Δ. We also develop new algorithms for (Δ+1)-edge-coloring in the 𝖫𝖮𝖢𝖠𝖫 model of distributed computation. Namely, we design a deterministic 𝖫𝖮𝖢𝖠𝖫 algorithm with running time 𝗉𝗈𝗅𝗒(Δ, loglog n) log^5 n and a randomized 𝖫𝖮𝖢𝖠𝖫 algorithm with running time 𝗉𝗈𝗅𝗒(Δ) log^2 n. The key new ingredient in our algorithms is a novel application of the entropy compression method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2023

Edge-Coloring Algorithms for Bounded Degree Multigraphs

In this paper, we consider algorithms for edge-coloring multigraphs G of...
research
04/07/2018

Tight Lower Bounds for List Edge Coloring

The fastest algorithms for edge coloring run in time 2^m n^O(1), where m...
research
07/05/2023

Density-Sensitive Algorithms for (Δ+ 1)-Edge Coloring

Vizing's theorem asserts the existence of a (Δ+1)-edge coloring for any ...
research
06/27/2018

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank

Computing the smallest number q such that the vertices of a given graph ...
research
10/12/2022

A nearly optimal randomized algorithm for explorable heap selection

Explorable heap selection is the problem of selecting the nth smallest v...
research
05/12/2022

Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation

For any real numbers B ≥ 1 and δ∈ (0, 1) and function f: [0, B] →ℝ, let ...
research
11/28/2017

Adapting Local Sequential Algorithms to the Distributed Setting

It is a well known fact that sequential algorithms which exhibit a stron...

Please sign up or login with your details

Forgot password? Click here to reset