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]
@inproceedings{ElkinPS15,
title = {(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting},
author = {Michael Elkin and Seth Pettie and Hsin-Hao Su},
year = {2015},
doi = {10.1137/1.9781611973730.26},
url = {http://dx.doi.org/10.1137/1.9781611973730.26},
researchr = {https://researchr.org/publication/ElkinPS15},
cites = {0},
citedby = {0},
pages = {355-370},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
editor = {Piotr Indyk},
publisher = {SIAM},
isbn = {978-1-61197-373-0},
}