scientific article; zbMATH DE number 7651156

DOI10.4230/LIPICS.ESA.2020.17MaRDI QIDQ5874483zbMATH OpenFDO

Authors

Publication date 7 February 2023

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

zbMATH Keywords

distributed computingrandomized algorithmsgraph coloringdecentralized algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A study of drift analysis for estimating computation time of evolutionary algorithms
• Adaptive drift analysis
• Concentration of first hitting times under additive drift
• Multiplicative drift analysis

Cited in

(3)

• Distributed ∆-coloring plays hide-and-seek
• An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm
• Message passing for the coloring problem: Gallager meets Alon and Kahale

This page was built for publication:

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