scientific article; zbMATH DE number 7559119
From MaRDI portal
Publication:5090456
DOI10.4230/LIPIcs.STACS.2019.10MaRDI QIDQ5090456
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1809.08140
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Colouring graphs when the number of colours is almost the maximum degree
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- The Locality of Distributed Symmetry Breaking
- Parallel Symmetry-Breaking in Sparse Graphs
- Locality in Distributed Graph Algorithms
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Improved Distributed Delta-Coloring
- An optimal distributed (Δ+1)-coloring algorithm?
- A lower bound for the distributed Lovász local lemma
- (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
- Distributed algorithms for the Lovász local lemma and graph coloring
- Graph colouring and the probabilistic method
This page was built for publication:
