有向图中s-t简单路的有效计数
Effectively Counting s-t Simple Paths in Directed Graphs
摘要：
分析复杂社会网络和信息网络的一个重要工具是s-t简单路径计数，它是P-完全的。本文研究了有向图中s-t简单路的有效计数问题。对于有向图中给定的一对顶点s和t，首先我们提出了一种剪枝技术，可以有效地大大减少搜索空间。然后，我们讨论了如何调整这种技术与精确和近似算法，以提高其效率。最后，通过在不同领域的几个网络上进行广泛的实验，我们展示了我们所提出的技术的高经验效率。我们的算法不是现有方法的竞争对手，相反，它是一个朋友，可以作为一个快速的预处理步骤，在应用任何现有的算法。
英文摘要：
An important tool in analyzing complex social and information networks is s-t simple path counting, which is known to be #P-complete. In this paper, we study efficient s-t simple path counting in directed graphs. For a given pair of vertices s and t in a directed graph, first we propose a pruning technique that can efficiently and considerably reduce the search space. Then, we discuss how this technique can be adjusted with exact and approximate algorithms, to improve their efficiency. In the end, by performing extensive experiments over several networks from different domains, we show high empirical efficiency of our proposed technique. Our algorithm is not a competitor of existing methods, rather, it is a friend that can be used as a fast pre-processing step, before applying any existing algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
