2 citations · 6 across the 3 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2012★ 2 cited
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard +2
In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that con…
cs.DC2012★ 2 cited
Building Fastest Broadcast Trees in Periodically-Varying Graphs
Arnaud Casteigts, Paola Flocchini, Bernard Mans +1
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Still, connectivity can generally be established over time…