14 citations · 14 across the 1 of their papers we have counts for
2 papers
cs.DC2014
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…
cs.DS2014★ 14 cited
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…