scientific article; zbMATH DE number 6850477

MaRDI QIDQ4608064zbMATH OpenFDO

Authors Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1708.04290, http://dl.acm.org/citation.cfm?id=3175473

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)

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

(11)

• Near-optimal, distributed edge colouring via the nibble method
• A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
• Distributed edge coloring and a special case of the constructive Lovász local lemma
• Classification of distributed binary labeling problems
• Almost global problems in the LOCAL model
• Borel Vizing's theorem for graphs of subexponential growth
• The power of multi-step Vizing chains
• Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022
• A time hierarchy theorem for the LOCAL model
• An exponential separation between randomized and deterministic complexity in the LOCAL model
• Local mending

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)