Abstract
The distributed coloring problem is at the core of the area of distributed graph algorithms and it is a problem that has recently seen remarkable progress. Much of the progress on deterministic algorithms is based on two main tools: a) defective colorings in which every node can have a limited number of neighbors of the same color and b) list coloring, a natural generalization of standard coloring that naturally appears when one has to extend a previously computed partial coloring to a full coloring.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
