时间图导论:数学观点
An Introduction to Temporal Graphs: An Algorithmic Perspective
摘要:
非正式地说,\emph{temporal graph}是一个随时间变化的图形。当时间是离散的并且只有参与实体之间的关系可能改变而实体本身不改变时,时间图可以被视为在相同(静态)节点集合$V$上的静态图的序列$G_1,G_2\ldots,G_l$。虽然静态图已经被广泛研究,但对于它们的时间推广,我们仍然远远没有一套具体的结构和算法原则。最近的研究表明,许多图的属性和问题变得完全不同,通常更困难时,一个额外的时间维添加到他们。此外,已经有一组丰富且快速增长的现代系统和应用程序可以通过时序图自然建模和研究。这进一步激发了发展图论的时间扩展的需要。我们在这里调查的时间图和时间图的问题,已经出现在计算机科学社会的最新成果。
英文摘要:
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\ldots,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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。