We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much faster than in the absence of any advice), whereas it is information insensitive if it requires giving a lot of information to the nodes in order to ensure fast computation of the solution. In this paper, we study the information sensitivity of distributed graph coloring. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Fraigniaud, P., Gavoille, C., Ilcinkas, D., & Pelc, A. (2007). Distributed computing with advice: Information sensitivity of graph coloring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 231–242). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_22
Mendeley helps you to discover research relevant for your work.