![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessConnected Subgraph Defense Games
We study a security game over a network played between a defender and k attackers. Every attacker chooses, probabilistically, a node of the network to damage. The defender chooses, probabilistically as well, a co...
-
Chapter and Conference Paper
The Temporal Explorer Who Returns to the Base
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 on n vertices. The aim of the exploratio...
-
Chapter and Conference Paper
Temporal Flows in Temporal Networks
We introduce temporal flows on temporal networks [17, 19], 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 some time. Ou...
-
Chapter and Conference Paper
On Verifying and Maintaining Connectivity of Interval Temporal Networks
An interval temporal network is, informally speaking, a network whose links change with time. The term interval means that a link may exist for one or more time intervals, called availability intervals of the lin...
-
Chapter and Conference Paper
On Temporally Connected Graphs of Small Cost
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 availability instanc...