Distributed Computing with Advice: Information Sensitivity of Graph Coloring - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Distributed Computing with Advice: Information Sensitivity of Graph Coloring

Résumé

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.
Fichier principal
Vignette du fichier
ICALP2007.pdf (165.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00339878 , version 1 (19-11-2008)

Identifiants

Citer

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⟩
335 Consultations
276 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More