A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Testing Temporal Connectivity in Sparse Dynamic Graphs
[article]
2014
arXiv
pre-print
We address the problem of testing whether a given dynamic graph is temporally connected, i.e a temporal path (also called a journey) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an evolving graph G={G_1,G_2,...,G_k} whose set of vertices is invariant and the set of (directed) edges varies over time. Two cases are studied, depending on whether a single edge or an unlimited number of edges can be crossed in a same G_i (strict
arXiv:1404.7634v2
fatcat:nmv7ytdi7rd6dkgfxfyy6gnl3m