Efficient Randomized Distributed Coloring in CONGEST

Cited by: 0|Views2

Abstract:

Distributed vertex coloring is one of the classic problems and probably also the most widely studied problems in the area of distributed graph algorithms. We present a new randomized distributed vertex coloring algorithm for the standard CONGEST model, where the network is modeled as an $n$-node graph $G$, and where the nodes of $G$ ope...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments