The use of static graphs for modelling and analysis of biological and biomedical data plays a
key role in biomedical research. However, many real-world scenarios present dynamic …

Temporal graphs are graphs whose topology is subject to discrete changes over time. Given
a static underlying graph G, a temporal graph is represented by assigning a set of integer …

The availability of industrial network topologies is limited, which presents a significant
challenge for researchers in this field. Network generators are essential tools for generating …

A temporal graph is an undirected graph $ G=(V, E) $ along with a function that assigns a
time-label to each edge in $ E $. A path in $ G $ with non-decreasing time-labels is called …

Dynamic networks are a complex subject. Not only do they inherit the complexity of static
networks (as a particular case); they are also sensitive to definitional subtleties that are a …

We consider the standard population protocol model, where (a priori) indistinguishable and
anonymous agents interact in pairs according to uniformly random scheduling. The self …

Abstract We consider Internet of Things (IoT) sensors deployed inside an area to be
monitored. Not all the sensors are connected via single-hop to the depot that requires the …

A temporal graph is a graph whose edges appear only at certain points in time. In these
graphs, reachability among the nodes relies on paths that traverse edges in chronological …

A temporal graph is a graph whose edges only appear at certain points in time. Reachability
in these graphs is defined in terms of paths that traverse the edges in chronological order …

In this paper we introduce the notions of blackout-tolerant temporal-spanner of a temporal
graph G which is a subgraph of G that preserves the distances between pairs of vertices of …