论文标题
在现实世界网络上双向BFS的确定性绩效保证
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
论文作者
论文摘要
图形中最短路径查询加快最短路径查询的一种常见技术是使用双向搜索，即，从起始开始执行正向搜索，从目的地从目的地进行向后搜索，直到找到最短路径上的常见顶点。实际上，这对某些现实世界网络的性能产生了巨大影响，而似乎只能节省其他类型的网络的不断因素。尽管找到最短的路径是一个无处不在的问题，但只有很少的研究试图了解某些网络上某些网络上明显的渐近加速度，使用对现实世界网络的某些模型的平均案例分析。 在本文中，我们通过分析允许理论分析的确定性属性，可以轻松地检查任何特定实例，从而给出一个新的观点。我们证明，这些参数意味着在几个方案中进行双向广度优先搜索的sublrinear运行时间，其中一些搜索很紧。此外，我们在大量的现实网络上执行实验，表明我们的参数可以很好地捕获实用运行时间的概念。
A common technique to speed up shortest path queries in graphs is to use a bidirectional search, i.e., performing a forward search from the start and a backward search from the destination until a common vertex on a shortest path is found. In practice, this has a tremendous impact on the performance on some real-world networks, while it only seems to save a constant factor on other types of networks. Even though finding shortest paths is a ubiquitous problem, there are only few studies attempting to understand the apparently asymptotic speedups on some networks, using average case analysis on certain models for real-world networks. In this paper we give a new perspective on this, by analyzing deterministic properties that permit theoretical analysis and that can easily be checked on any particular instance. We prove that these parameters imply sublinear running time for the bidirectional breadth-first search in several regimes, some of which are tight. Moreover, we perform experiments on a large set of real-world networks showing that our parameters capture the concept of practical running time well.
