An introduction to temporal graphs: an algorithmic perspective

DOI10.1007/978-3-319-24024-4_18MaRDI QIDQ3464477zbMATH OpenOpenAlexFDO

Publication date 27 January 2016

Published in Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.00278

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Abstract: A emph{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

G_{1}, G_{2} l d o t s, G_{l}

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.

Recommendations

Cites work

Cited in

(45)

This page was built for publication: An introduction to temporal graphs: an algorithmic perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464477)