We study here the issues of testing and designing (nearly cost-optimal)<lb>temporal networks that are temporally connected. We follow the tempo-<lb>ral (di)graphs abstraction, where each edge (arc) eâ€¦ (More)

We consider here a model of temporal networks, the links of which are available only at certain moments in time, chosen randomly from a subset of the positive integers. We define the notion of theâ€¦ (More)

We introduce temporal flows on temporal networks [36, 42], i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists afterâ€¦ (More)

We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discreteâ€¦ (More)

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 static underlying graphâ€¦ (More)

In this work we consider temporal networks, the links of which are available only at random times (randomly available temporal networks). Our networks are {\em ephemeral}: their links appearâ€¦ (More)

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 discrete momentsâ€¦ (More)