Abstract

In this paper, we propose the problem of multi-constrained-s–t simple paths enumeration on temporal graph, which aims to list all temporal paths with the minimum timestamp in the given time interval. To solve this problem, a two-stage algorithm based on temporal subgraph is proposed. In the first stage, two algorithms for creating temporal subgraph are proposed to reduce the search scope. The first creates subgraph based on temporal graph, which uses the results of the vertex pruning algorithm to prune the temporal graph. The second creates temporal subgraph based on edge stream, which reorders the edge stream, traverses the edge stream bidirectionally, and uses the flags to prune edges. In the second stage, the depth-first search algorithm is used to find the paths on the temporal subgraph, and the pruning strategies are used to reduce the search scope. We conduct comprehensive experiments on 8 real datasets. Our experiment results demonstrate the efficiency of our proposed algorithm.

中文翻译：

---

枚举时间图上的所有多重约束 s-t 路径

摘要

在本文中，我们提出了时间图上的多约束-s - t简单路径枚举问题，其目的是列出给定时间间隔内具有最小时间戳的所有时间路径。为了解决这个问题，提出了一种基于时间子图的两阶段算法。在第一阶段，提出了两种创建时间子图的算法来缩小搜索范围。第一个基于时间图创建子图，它使用顶点修剪算法的结果来修剪时间图。第二个基于边缘流创建时间子图，对边缘流进行重新排序，双向遍历边缘流，并使用标志来修剪边缘。第二阶段，采用深度优先搜索算法寻找时间子图上的路径，并采用剪枝策略缩小搜索范围。我们在 8 个真实数据集上进行了全面的实验。我们的实验结果证明了我们提出的算法的效率。