Improved distributed \(\Delta\)-coloring
type: Item
instance of: scholarly article
title: Improved distributed \(\Delta\)-coloring
author: Mohsen Ghaffari
author: Juho Hirvonen
author: Fabian Kuhn
author: Yannic Maus
published in: Distributed Computing
publication date: 2021-09-06T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7391412
MaRDI profile type: Publication
full work available at URL: s00446-021-00397-4
OpenAlex ID: W3179553191
cites work: Distributed Coloring in Sparse Graphs with Fewer Colors
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: Distributed Graph Coloring: Fundamentals and Recent Developments
cites work: Locally-Iterative Distributed (Δ+ 1)
cites work: The Locality of Distributed Symmetry Breaking
cites work: Q3097395
cites work: A lower bound for the distributed Lovász local lemma
cites work: Brief Announcement
cites work: An optimal distributed (Δ+1)-coloring algorithm?
cites work: Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
cites work: Brooks' Theorem and Beyond
cites work: Q3922703
cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
cites work: An Improved Distributed Algorithm for Maximal Independent Set
cites work: On the complexity of local distributed graph problems
cites work: Distributed Degree Splitting, Edge Coloring, and Orientations
cites work: Distributed (∆+1)-coloring in sublogarithmic rounds
cites work: Faster Deterministic Distributed Coloring Through Recursive List Coloring
cites work: Locality in Distributed Graph Algorithms
cites work: Three short proofs in graph theory
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Graph colouring and the probabilistic method
cites work: The local nature of \(\Delta\)-coloring and its algorithmic applications
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization
cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth
cites work: Q4135588
cites work: Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy
DOI: 10.1007/S00446-021-00397-4
description: scientific article; zbMATH DE number 7391412