@inproceedings{f5c8e9b4a5d24911a549fbf9198d7dab,
title = "Fast Distributed Vertex Splitting with Applications.",
abstract = "We present poly log log n-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into k parts such that a node of degree d(u) has ≈ d(u)/k neighbors in each part. Our techniques can be seen as the first progress towards general poly log log n-round algorithms for the Lov{\'a}sz Local Lemma. As the main application of our result, we obtain a randomized poly log log n-round CONGEST algorithm for (1 + ε)∆-edge coloring n-node graphs of sufficiently large constant maximum degree ∆, for any ε > 0. Further, our results improve the computation of defective colorings and certain tight list coloring problems. All the results improve the state-of-the-art round complexity exponentially, even in the LOCAL model.",
keywords = "CONGEST model, Distributed computing, Edge coloring, Graph problems, List coloring, LOCAL model, Lov{\'a}sz local lemma",
author = "Halld{\'o}rsson, {Magn{\'u}s M.} and Yannic Maus and Alexandre Nolin",
note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 36th International Symposium on Distributed Computing : DISC 2022 ; Conference date: 25-10-2022 Through 27-10-2022",
year = "2022",
month = oct,
day = "1",
doi = "10.4230/LIPICS.DISC.2022.26",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "26:1--26:24",
editor = "Christian Scheideler",
booktitle = "36th International Symposium on Distributed Computing (DISC 2022)",
address = "Germany",
}