2 citations · 2 across the 2 of their papers we have counts for
2 papers
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.NI2010★ 2 cited
Construction et maintien d'une forêt couvrante dans un réseau dynamique
Yoann Pigné, Arnaud Casteigts, Frédéric Guinand +1
In this work we introduce the principles of an algorithm that constructs and maintains a spanning forest in a mobile telecommunication network-a MANET. The algorithm is based on th…