Distributed (delta+1)-coloring in linear (in delta) time
Clinical Orthopaedics and Related Research, Volume 43, Issue 1, 2014, Pages 72-95.
lower bounditerative algorithmgraph coloringdistributed algorithm
The distributed (Delta + 1)-coloring problem is one of most fundamental and well-studied problems of Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of gradually improving algorithms published. The current state-of-the-art running time is O(Delta log Delta + log^* n), due to Kuhn and Wattenh...More
PPT (Upload PPT)