1 citations · 1 across the 4 of their papers we have counts for
3 papers · 1 filter
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3
Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph , a temporal graph on is a seque…
The temporal explorer who returns to the base
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
In this paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star. The aim…
Temporal Vertex Cover with a Sliding Time Window
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis +1
Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time. Given a stat…