scientific article; zbMATH DE number 6850477
From MaRDI portal
Publication:4608064
Recommendations
- Deterministic distributed edge-coloring with fewer colors
- Near-optimal distributed edge coloring
- scientific article; zbMATH DE number 1875427
- On the complexity of distributed graph coloring
- Fast randomized algorithms for distributed edge coloring (extended abstract)
- An experimental study of a simple, distributed edge-coloring algorithm
- Nearly optimal distributed edge coloring in O(log log n) rounds
- On the Complexity of Distributed Greedy Coloring
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
Cited in
(16)- Near-optimal, distributed edge colouring via the nibble method
- Local mending
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- A time hierarchy theorem for the LOCAL model
- Distributed edge coloring and a special case of the constructive Lovász local lemma
- Almost global problems in the LOCAL model
- The power of multi-step Vizing chains
- Classification of distributed binary labeling problems
- Borel Vizing's theorem for graphs of subexponential growth
- Streaming edge coloring with subquadratic palette size
- Sparsity-parameterised dynamic edge colouring
- Arboricity-dependent algorithms for edge coloring
- Fast algorithms for Vizing's theorem on bounded degree graphs
- The greedy algorithm is not optimal for on-line edge coloring
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 Q4608064)
