25 citations · 71 across the 20 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
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…
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…