Fabian Kuhn, Roger Wattenhofer. On the complexity of distributed graph coloring. In Eric Ruppert, Dahlia Malkhi, editors, Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006. pages 7-15, ACM, 2006. [doi]
@inproceedings{KuhnW06,
title = {On the complexity of distributed graph coloring},
author = {Fabian Kuhn and Roger Wattenhofer},
year = {2006},
doi = {10.1145/1146381.1146387},
url = {http://doi.acm.org/10.1145/1146381.1146387},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KuhnW06},
cites = {0},
citedby = {0},
pages = {7-15},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006},
editor = {Eric Ruppert and Dahlia Malkhi},
publisher = {ACM},
isbn = {1-59593-384-0},
}