research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Inproceedings
Entered by:
TitleAn Introduction to Temporal Graphs: An Algorithmic Perspective
Bibtex cite IDRACTI-RU1-2015-10
Booktitle Algorithms, Probability, Networks, and Games - Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday
Series Lecture Notes in Computer Science
Year published 2015
Month September
Volume 9295
Pages 308-343
Publisher Springer
URL http://link.springer.com/chapter/10.1007%2F978-3-319-24024-4_18
DOI 10.1007/978-3-319-24024-4_18
Abstract
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,G2,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.
Authors
Michail, Othon
Topics
Top
BibTeXBibTeX
RISRIS
Attachments
Mi15-APNG.pdf (main file)
 
Publication ID1083