Locality in Distributed Graph Algorithms

Pierre Fraigniaud (1, 2)

1 IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale
2 GANG - Networks, Graphs and Algorithms

Survey of core results in the context of locality in distributed graph algorithms.

Mots clés: Distributed Computing; Network Computing; Coloring; Maximal Independent Set

Domaines: Algorithme et structure de données [cs.DS]; Calcul parallèle, distribué et partagé [cs.DC]

Pierre Fraigniaud. Locality in Distributed Graph Algorithms. Encyclopedia of Algorithms, Springer, pp.1143-1148, 2016, 978-1-4939-2863-7. ⟨10.1007/978-1-4939-2864-4_608⟩. ⟨hal-01423632⟩