Locality in Distributed Graph Algorithms

Pierre Fraigniaud 1, 2
1 IRIF - Institut de Recherche en Informatique Fondamentale
2 GANG - Networks, Graphs and Algorithms
Inria de Paris, IRIF - Institut de Recherche en Informatique Fondamentale
Abstract : Survey of core results in the context of locality in distributed graph algorithms.
Keywords : Maximal Independent Set Network Computing Coloring Distributed Computing
Document type :
Book sections
Complete list of metadatas
https://hal.inria.fr/hal-01423632
Contributor : Pierre Fraigniaud <>
Submitted on : Friday, December 30, 2016 - 5:34:02 PM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM
Long-term archiving on: Monday, March 20, 2017 - 6:52:31 PM

File

locality.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | UNIV-PARIS7 | INRIA | USPC

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

184

Files downloads

283

 

 

Contact

archive-ouverte@inria.fr

 

</div