Graph generators: State of the art and open challenges
The abundance of interconnected data has fueled the design and implementation of graph
generators reproducing real-world linking properties or gauging the effectiveness of graph …
generators reproducing real-world linking properties or gauging the effectiveness of graph …
Stream graphs and link streams for the modeling of interactions over time
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 …
to study interactions over time too. However, it poorly captures the intrinsically temporal and …
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 …
Efficient algorithms for temporal path computation
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 …
concept of classic shortest path is insufficient. In this paper, we study various concepts of …
Dynamic graph representation learning with neural networks: A survey
In recent years, Dynamic Graph (DG) representations have been increasingly used for
modeling dynamic systems due to their ability to integrate both topological and temporal …
modeling dynamic systems due to their ability to integrate both topological and temporal …
Spiking neural P systems with scheduled synapses
Spiking neural P systems (SN P systems) are models of computation inspired by biological
spiking neurons. SN P systems have neurons as spike processors, which are placed on the …
spiking neurons. SN P systems have neurons as spike processors, which are placed on the …
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 …
Complex systems: A communication networks perspective towards 6G
Over the last few years, the analysis and modeling of networks as well as the analysis and
modeling of networked dynamical systems, has attracted considerable interdisciplinary …
modeling of networked dynamical systems, has attracted considerable interdisciplinary …
[HTML][HTML] Traveling salesman problems in temporal graphs
O Michail, PG Spirakis - Theoretical Computer Science, 2016 - Elsevier
In this work, we introduce the notion of time to some well-known combinatorial optimization
problems. In particular, we study problems defined on temporal graphs. A temporal graph …
problems. In particular, we study problems defined on temporal graphs. A temporal graph …
[图书][B] Social data analytics
This book is an introduction to social data analytics along with its challenges and
opportunities in the age of Big Data and Artificial Intelligence. It focuses primarily on …
opportunities in the age of Big Data and Artificial Intelligence. It focuses primarily on …