14 citations · 14 across the 3 of their papers we have counts for
3 papers
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree
Ajoy K. Datta, Stéphane Devismes, Colette Johnen +1
We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorit…
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…