Michael Elkin, Seth Pettie, Hsin-Hao Su. (2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 355-370, SIAM, 2015. [doi]
Abstract is missing.