Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

DOI10.1145/3382734.3405710MaRDI QIDQ5855248zbMATH OpenOpenAlexWikidataFDO

Authors Alkida Balliu, Fabian Kuhn, Dennis Olivetti

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.10780

zbMATH Keywords

edge coloringgraph coloringgraph problemsLOCAL model

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(5)

• Linial for lists
• The power of multi-step Vizing chains
• Local conflict coloring revisited: Linial for lists
• Brief announcement: Simpler and more general distributed coloring based on simple list defective coloring algorithms
• Distributed edge coloring in time polylogarithmic in \({\Delta }\)

This page was built for publication: Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

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