25 citations · 71 across the 20 of their papers we have counts for
3 papers · 1 filter
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette +2
Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split…
Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette +2
We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({\em journey}) exists between all pairs of vertices. We consider a discrete…
Testing Temporal Connectivity in Sparse Dynamic Graphs
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette +2
We address the problem of testing whether a given dynamic graph is temporally connected, {\it i.e} a temporal path (also called a {\em journey}) exists between all pairs of vertice…