| Article Details | ||
|---|---|---|
| Title: | (2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Michael Elkin |
|
| Seth Pettie |
|
|
| Hsin-Hao Su |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1217338, 1318294 | |
| DBLP Key: | conf/soda/ElkinPS15 | |
| Author Comments: | ||