A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm

DOI10.1016/j.ipl.2023.106385arXiv2106.00402OpenAlexW4322619122MaRDI QIDQ6161445

Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringgames on graphsdistributed computinggreedy algorithmssymmetric strategies

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Stochastic orders
• Extreme variances of order statistics in dependent samples
• Simple distributed \(\Delta+1\)-coloring of graphs
• Network Coloring and Colored Coin Games
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Locality in Distributed Graph Algorithms
• Maximally dependent random variables
• Distributed Graph Coloring: Fundamentals and Recent Developments
• An optimal distributed (Δ+1)-coloring algorithm?
• Graph colouring and the probabilistic method

This page was built for publication: A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm