Distributed computing with advice: information sensitivity of graph coloring


FREE-DOWNLOAD P Fraigniaud, C Gavoille, D Ilcinkas… – Distributed Computing, 2009 –

Abstract We study the problem of the amount of informa- tion (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 sensitiv- ity of a network problem. A problem is



IEEE-PAPER



Distributed computing with advice: information sensitivity of graph coloring IEEE PAPER

COMMENT computer science, free research papers









FREE IEEE PAPER
IEEE-PAPER
IEEE PROJECTS IEEE PAPERS EEE CSE ECE FREE DOWNLOAD PDF COMPUTER SCIENCE NEW IEEE PROJECTS IEEE MINI PROJECTS USA