14 citations · 14 across the 2 of their papers we have counts for
3 papers
Efficiently Testing T-Interval Connectivity in Dynamic Graphs
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz +1
Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a {\em global} and {\em discrete} standpoint, these networks are o…
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…
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…