1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
Sophia Heck, Eleni Akrida
Modern networks are highly dynamic, and temporal graphs capture these changes through discrete edge appearances on a fixed vertex set, known in advance up to the graph's lifetime.…
Matching in Stochastically Evolving Graphs
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios +2
This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a g…
Temporal flows in Temporal networks
Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec +2
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exi…
Moving in temporal graphs with very sparse random availability of edges
Paul G. Spirakis, Eleni Ch. Akrida
In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the…