25 citations · 25 across the 4 of their papers we have counts for
4 papers · 1 filter
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
Arnaud Casteigts, Yves Métivier, John Michael Robson
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering t…
Finding Structure in Dynamic Networks
Arnaud Casteigts
This document is the first part of the author's habilitation thesis (HDR), defended on June 4, 2018 at the University of Bordeaux. Given the nature of this document, the contributi…
Robustness in Highly Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property that we refer to as {\em robustness}. A property is {\em robust} in a given graph if it is inherited by all connected spanning…
Counting in One-Hop Beeping Networks
A. Casteigts, Y. Métivier, J. M. Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the variant, processes can choose in each rou…