Locality in distributed graph algorithms
SIAM Journal on Computing
On the complexity of distributed network decomposition
Journal of Algorithms
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On greedy graph coloring in the distributed model
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.00 |
Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. It still consists in coloring in a distributed setting each node of a given graph in such a way that two adjacent nodes do not get the same color, but it adds a further constraint. Given an order among the colors, a coloring is said to be greedy if there does not exist a node for which its associated color can be replaced by a color of lower position in this order without violating the coloring property. We provide lower and upper bounds for this problem in Linial's model and we relate them to other well-known problems, namely Coloring, Maximal Independent Set (MIS), and Largest First Coloring. Whereas the best known upper bound for Coloring, MIS, and Greedy Coloring are the same, we prove a lower bound which is strong in the sense that it now makes a difference between Greedy Coloring and MIS.