Skip to Main content Skip to Navigation
Conference papers

Distributed Computing with Advice: Information Sensitivity of Graph Coloring

Abstract : 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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : David Ilcinkas <>
Submitted on : Wednesday, November 19, 2008 - 11:50:10 AM
Last modification on : Friday, March 27, 2020 - 3:59:43 AM
Long-term archiving on: : Monday, June 7, 2010 - 11:06:26 PM


Files produced by the author(s)




Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007, Jul 2007, Wrocław, Poland. pp.231-242, ⟨10.1007/978-3-540-73420-8_22⟩. ⟨hal-00339878⟩



Record views


Files downloads