Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

25 Feb 2020 Balliu Alkida Kuhn Fabian Olivetti Dennis

The problem of coloring the edges of an $n$-node graph of maximum degree $\Delta$ with $2\Delta - 1$ colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this problem, the dependency of the running time on $\Delta$ has been a long-standing open question... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING
  • DATA STRUCTURES AND ALGORITHMS