--
Maxime Flin
(Reykjavik University)
summary: The study of distributed graph algorithms aims to understand the limitations
inherent to local computations. In a seminal paper, Linial (1992, SIAM J. Computing)
introduced the LOCAL model to formalize this question. In this model, the input graph
is seen as a communication network where vertices are computers. They ...
