๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the twenty-fifth annual ACM symposium - Denver, Colorado, USA (2006.07.23-2006.07.26)] Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06 - On the complexity of distributed graph coloring

โœ Scribed by Kuhn, Fabian; Wattenhofer, Roger


Book ID
121826054
Publisher
ACM Press
Year
2006
Weight
193 KB
Category
Article
ISBN-13
9781595933843

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the twenty-fifth annual ACM s
โœ Kuhn, Fabian; Wattenhofer, Roger ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› ACM Press โš– 193 KB

Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a distributed setting. Processors of a distributed system are nodes of an undirected graph G. There is an edge between two no