Improved distributed \(\Delta\)-coloring
From MaRDI portal
Publication:1981630
DOI10.1007/s00446-021-00397-4OpenAlexW3179553191MaRDI QIDQ1981630
Juho Hirvonen, Yannic Maus, Mohsen Ghaffari, Fabian Kuhn
Publication date: 6 September 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-021-00397-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetry breaking depending on the chromatic number or the neighborhood growth
- Three short proofs in graph theory
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- The Locality of Distributed Symmetry Breaking
- Brooks' Theorem and Beyond
- 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
- Distributed Computing: A Locality-Sensitive Approach
- An Improved Distributed Algorithm for Maximal Independent Set
- Distributed Degree Splitting, Edge Coloring, and Orientations
- On the complexity of local distributed graph problems
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- Distributed Coloring in Sparse Graphs with Fewer Colors
- Locally-Iterative Distributed (Δ+ 1)
- An optimal distributed (Δ+1)-coloring algorithm?
- Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
- Distributed (∆+1)-coloring in sublogarithmic rounds
- A lower bound for the distributed Lovász local lemma
- Brief Announcement
- A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
- Graph colouring and the probabilistic method
This page was built for publication: Improved distributed \(\Delta\)-coloring
