Foundations and modeling of dynamic networks using dynamic graph neural networks: A survey

J Skarding, B Gabrys, K Musial - iEEE Access, 2021 - ieeexplore.ieee.org
Dynamic networks are used in a wide range of fields, including social network analysis,
recommender systems and epidemiology. Representing complex networks as structures …

Big networks: A survey

HD Bedru, S Yu, X Xiao, D Zhang, L Wan, H Guo… - Computer Science …, 2020 - Elsevier
A network is a typical expressive form of representing complex systems in terms of vertices
and links, in which the pattern of interactions amongst components of the network is intricate …

Review of methodologies and tasks in swarm robotics towards standardization

N Nedjah, LS Junior - Swarm and Evolutionary Computation, 2019 - Elsevier
Swarm Robotics (SR) is an extension of the study of Multi-Robot Systems that exploits
concepts of communication, coordination and collaboration among a large number of robots …

Deleting edges to restrict the size of an epidemic in temporal networks

J Enright, K Meeks, GB Mertzios, V Zamaraev - Journal of Computer and …, 2021 - Elsevier
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 …

[HTML][HTML] Temporal vertex cover with a sliding time window

EC Akrida, GB Mertzios, PG Spirakis… - Journal of Computer and …, 2020 - Elsevier
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 …

The complexity of temporal vertex cover in small-degree graphs

T Hamm, N Klobas, GB Mertzios… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Temporal graphs naturally model graphs whose underlying topology changes over time.
Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal …

[HTML][HTML] The complexity of computing optimum labelings for temporal connectivity

N Klobas, GB Mertzios, H Molter, PG Spirakis - Journal of Computer and …, 2024 - Elsevier
A graph is temporally connected if a strict temporal path exists from every vertex u to every
other vertex v. This paper studies temporal design problems for undirected temporally …

Anomaly Detection in Dynamic Graphs: A Comprehensive Survey

OA Ekle, W Eberle - ACM Transactions on Knowledge Discovery from …, 2024 - dl.acm.org
This survey paper presents a comprehensive and conceptual overview of anomaly detection
using dynamic graphs. We focus on existing graph-based anomaly detection (AD) …

Sliding window temporal graph coloring

GB Mertzios, H Molter, V Zamaraev - Journal of Computer and System …, 2021 - Elsevier
Graph coloring is one of the most famous computational problems with applications in a
wide range of areas such as planning and scheduling, resource allocation, and pattern …

Temporal cliques admit sparse spanners

A Casteigts, JG Peters, J Schoeters - Journal of Computer and System …, 2021 - Elsevier
Abstract Let G=(V, E) be an undirected graph on n vertices and λ: E→ 2 N a mapping that
assigns to every edge a non-empty set of integer labels (discrete times when the edge is …