Delay tolerant networks (DTNs) may lack continuous network connectivity. Routing in DTNs
is thus challenging since it must handle network partitioning, long delays, and dynamic …

Network analysis is widely used in diverse fields and can be a powerful framework for
studying the structure of biological systems. Temporal dynamics are a key issue for many …

Graph theory provides a language for studying the structure of relations, and it is often used
to study interactions over time too. However, it poorly captures the intrinsically temporal and …

The past few years have seen intensive research efforts carried out in some apparently
unrelated areas of dynamic systems–delay-tolerant networks, opportunistic-mobility …

Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient or even flawed in a temporal graph, as the …

Many networks are dynamic in that their topology changes rapidly—on the same time scale
as the communications of interest between network nodes. Examples are the human contact …

Temporal networks, ie, networks in which the interactions among a set of elementary units
change over time, can be modelled in terms of time-varying graphs, which are time-ordered …

The past decade has seen intensive research efforts on highly dynamic wireless and mobile
networks (variously called delay-tolerant, disruptive-tolerant, challenged, opportunistic, etc) …

Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient. In this paper, we study various concepts of …

Many natural and technological applications generate time-ordered sequences of networks,
defined over a fixed set of nodes; for example, time-stamped information about “who phoned …