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 …
that one can better understand its function as a whole. Sometimes it is beneficial, however …
Elements of the theory of dynamic networks
O Michail, PG Spirakis - Communications of the ACM, 2018 - dl.acm.org
Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …
An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
An improved genetic algorithm for path-planning of unmanned surface vehicle
J Xin, J Zhong, F Yang, Y Cui, J Sheng - Sensors, 2019 - mdpi.com
The genetic algorithm (GA) is an effective method to solve the path-planning problem and
help realize the autonomous navigation for and control of unmanned surface vehicles. In …
help realize the autonomous navigation for and control of unmanned surface vehicles. In …
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer - Journal of Computer and System …, 2021 - Elsevier
The temporal graph exploration problem TEXP is the problem of computing a foremost
exploration schedule for a temporal graph, ie, a temporal walk that starts at a given start …
exploration schedule for a temporal graph, ie, a temporal walk that starts at a given start …
[HTML][HTML] The complexity of finding small separators in temporal graphs
Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …
problem of finding a small vertex set (the separator) whose removal destroys all temporal …
Deleting edges to restrict the size of an epidemic in temporal networks
Spreading processes on graphs are a natural model for a wide variety of real-world
phenomena, including information spread over social networks and biological diseases …
phenomena, including information spread over social networks and biological diseases …
[HTML][HTML] Temporal vertex cover with a sliding time window
Modern, inherently dynamic systems are usually characterized by a network structure which
is subject to discrete changes over time. Given a static underlying graph, a temporal graph …
is subject to discrete changes over time. Given a static underlying graph, a temporal graph …
[HTML][HTML] Temporal graph classes: A view through temporal separators
We investigate for temporal graphs the computational complexity of separating two distinct
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
AS Himmel, H Molter, R Niedermeier… - Social Network Analysis …, 2017 - Springer
Dynamics of interactions play an increasingly important role in the analysis of complex
networks. A modeling framework to capture this is temporal graphs which consist of a set of …
networks. A modeling framework to capture this is temporal graphs which consist of a set of …