(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Michael Elkin' in GoogleThis author has not been identified. Look up 'Seth Pettie' in GoogleThis author has not been identified. Look up 'Hsin-Hao Su' in Google

runs on WebDSL