Improved distributed algorithms for the Lovász local lemma and edge coloring

DOI10.1137/1.9781611977554.CH163MaRDI QIDQ6538696zbMATH OpenFDO

Authors P. Davies

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH163

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Parallel derandomization for coloring
• Sparsity-parameterised dynamic edge colouring
• Borel Vizing's theorem for graphs of subexponential growth
• The distributed complexity of locally checkable labeling problems beyond paths and trees
• Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index

This page was built for publication: Improved distributed algorithms for the Lovász local lemma and edge coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538696)