arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1919cs.DScs.DB
收藏

时态图遍历:定义、算法和应用

Temporal Graph Traversals: Definitions, Algorithms, and Applications

Silu Huang, James Cheng, Huanhuan Wu

摘要:

时态图是其中顶点之间的连接在特定时间是活动的图,并且这样的时态信息导致在非时态图中不存在的全新模式和知识。本文研究时态图中的遍历问题。图遍历,如DFS和BFS,是处理和研究图的基本操作。虽然DFS和BFS都是众所周知的简单概念,但从非时态图到时态图采用相同的概念是不平凡的。我们分析了定义时态图遍历的困难,并提出了新的定义DFS和BFS的时态图。我们研究了时间DFS和BFS的性质,并提出了具有最佳复杂度的有效算法。特别是,我们还研究了时间DFS和BFS的重要应用。我们验证了我们的图遍历算法在现实世界中的时间图的效率和重要性。

英文摘要:

A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph. In this paper, we study traversal problems in a temporal graph. Graph traversals, such as DFS and BFS, are basic operations for processing and studying a graph. While both DFS and BFS are well-known simple concepts, it is non-trivial to adopt the same notions from a non-temporal graph to a temporal graph. We analyze the difficulties of defining temporal graph traversals and propose new definitions of DFS and BFS for a temporal graph. We investigate the properties of temporal DFS and BFS, and propose efficient algorithms with optimal complexity. In particular, we also study important applications of temporal DFS and BFS. We verify the efficiency and importance of our graph traversal algorithms in real world temporal graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑