SODA 2015
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM-SIAM Symposium on Discrete Algorithms
- Archive span
- 1990-2025
- Indexed papers
- 4674
- Paper id
- 325587260482634975