[HTML][HTML] Modern temporal network theory: a colloquium

P Holme - The European Physical Journal B, 2015 - Springer
The power of any kind of network approach lies in the ability to simplify a complex system so
that one can better understand its function as a whole. Sometimes it is beneficial, however …

[HTML][HTML] Epidemics on dynamic networks

J Enright, RR Kao - Epidemics, 2018 - Elsevier
In many populations, the patterns of potentially infectious contacts are transients that can be
described as a network with dynamic links. The relative timescales of link and contagion …

Stream graphs and link streams for the modeling of interactions over time

M Latapy, T Viard, C Magnien - Social Network Analysis and Mining, 2018 - Springer
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 …

STAG-based QoS support routing strategy for multiple missions over the satellite networks

T Zhang, H Li, S Zhang, J Li… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
As the typical delay tolerant networks, the satellite networks possess the intermittent
connections, the large-scale time delays and the time-varying topologies. Obviously, such …

Cooperative earth observation through complex space information networks

J Du, C Jiang, Q Guo, M Guizani… - IEEE wireless …, 2016 - ieeexplore.ieee.org
Space-based information networking (SBIN) was proposed to broaden the observation area
and realize continuous information acquisition for Earth observation. It is corroborated to be …

RadarMAC: Mitigating radar interference in self-driving cars

J Khoury, R Ramanathan, D McCloskey… - 2016 13th Annual …, 2016 - ieeexplore.ieee.org
Self-driving cars typically rely on a set of radars for mapping the environment to avoid
obstacles and operate safely. Currently, the radar parameters are uncoordinated and can …

[HTML][HTML] Optimizing reachability sets in temporal graphs by delaying

A Deligkas, I Potapov - Information and Computation, 2022 - Elsevier
A temporal graph is a dynamic graph where every edge is assigned a set of integer time
labels that indicate at which discrete time step the edge is available. In this paper, we study …

[HTML][HTML] The complexity of optimal design of temporally connected graphs

EC Akrida, L Gąsieniec, GB Mertzios… - Theory of Computing …, 2017 - Springer
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 …

Characterizing the capability of vehicular fog computing in large-scale urban environment

X Kui, Y Sun, S Zhang, Y Li - Mobile Networks and Applications, 2018 - Springer
The worldwide increase of vehicles is demanding the deployment of an intelligent
transportation system for the urban environment. Recently, cloud computing technology is …

Survivability in time-varying networks

Q Liang, E Modiano - IEEE Transactions on Mobile Computing, 2016 - ieeexplore.ieee.org
Time-varying graphs are a useful model for networks with dynamic connectivity such as
vehicular networks, yet, despite their great modeling power, many important features of time …