Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications

Le résumé fourni par la source

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.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.