# An Introduction to Temporal Graphs: An Algorithmic Perspective

arXiv: https://arxiv.org/abs/1503.00278 · HTML: https://mlsanity.com/paper/1503.00278/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Mar 2015.

## Built on by (most cited first, 10 of 10)

- [The Capacity and Robustness Trade-off: Revisiting the Channel Independent Strategy for Multivariate Time Series Forecasting](https://mlsanity.com/paper/2304.05206/) (2023)
- [TIGGER: Scalable Generative Modelling for Temporal Interaction Graphs](https://mlsanity.com/paper/2203.03564/) (2022)
- [Dynamic Graph Representation Learning with Neural Networks: A Survey](https://mlsanity.com/paper/2304.05729/) (2023)
- [Efficient Dynamic Attributed Graph Generation](https://mlsanity.com/paper/2412.08810/) (2024)
- [Temporal Graph Pattern Machine](https://mlsanity.com/paper/2601.22454/) (2026)
- [As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy](https://mlsanity.com/paper/2307.12898/) (2023)
- [GSA-Forecaster: Forecasting Graph-Based Time-Dependent Data with Graph Sequence Attention](https://mlsanity.com/paper/2104.05914/) (2021)
- [Approximating Optimal Labelings for Temporal Connectivity](https://mlsanity.com/paper/2504.16837/) (2025)
- [Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity](https://mlsanity.com/paper/2510.03899/) (2025)
- [Time-Varying Data as Sheaves: an Invitation to Narratives](https://mlsanity.com/paper/2609.09056/) (2026)

## Abstract (arXiv)

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 the entities themselves, a temporal graph may be viewed as a sequence G1,G2ldots,Gl of static graphs over the same (static) set of nodes V. Though static graphs have been extensively studied, for their temporal generalization we are still far from having a concrete set of structural and algorithmic principles. Recent research shows that many graph properties and problems become radically different and usually substantially more difficult when an extra time dimension in added to them. Moreover, there is already a rich and rapidly growing set of modern systems and applications that can be naturally modeled and studied via temporal graphs. This, further motivates the need for the development of a temporal extension of graph theory. We survey here recent results on temporal graphs and temporal graph problems that have appeared in the Computer Science community.