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 In this paper, we study the information sensitivity of distributed graph coloring.
The concept of information sensitivity was introduced in REF : a problem is information sensitive if few bits of advice suffice to drastically improve the efficiency of solving it.
Distributed computing with advice: information sensitivity of graph coloring
Distributed Computing
Distributed Computing
Computer Science