Foundations and modeling of dynamic networks using dynamic graph neural networks: A survey
Dynamic networks are used in a wide range of fields, including social network analysis,
recommender systems and epidemiology. Representing complex networks as structures …
recommender systems and epidemiology. Representing complex networks as structures …
Big networks: A survey
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 …
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
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 …
concepts of communication, coordination and collaboration among a large number of robots …
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 …
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 …
Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal …
[HTML][HTML] The complexity of computing optimum labelings for temporal connectivity
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 …
other vertex v. This paper studies temporal design problems for undirected temporally …
Anomaly Detection in Dynamic Graphs: A Comprehensive Survey
This survey paper presents a comprehensive and conceptual overview of anomaly detection
using dynamic graphs. We focus on existing graph-based anomaly detection (AD) …
using dynamic graphs. We focus on existing graph-based anomaly detection (AD) …
Sliding window temporal graph coloring
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 …
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 …
assigns to every edge a non-empty set of integer labels (discrete times when the edge is …