复杂网络中近似最短路径问题-计算机系统应用.PDF

2016 年 第 25 卷 第 5 期 计 算 机 系 统 应 用 ① 复杂网络中近似最短路径问题 刘 微, 肖华勇 (西北工业大学 理学院, 西安 710072) 摘 要: 随着网络规模的不断增大, 经典算法(如 Dijkstra 等)效率越来越低. 针对这一问题, 研究者们提出了许多 近似搜索算法, 但如何既能提高搜索效率又能保持准确性一直是一大难点. 本文根据复杂网络的结构特性引入 区域划分, 同时改进树分解的构造, 将图构造成一棵树进行搜索, 得到了一个新的适合于复杂网络的最短路径近 似算法. 此外通过实例验证, 该算法不仅在一定程度上降低了计算复杂性, 而且保持了较高的近似准确性. 关键词: 复杂网络; 树分解; 树宽; 树; 最短路径近似算法 Approximate Shortest Path Problem in Complex Networks LIU Wei, XIAO Hua-Yong (Science of School, Northwestern Polytechnical University, Xi’an 710072, China) Abstract: With the increasing of data in complex networks, the efficiency of classic algorithms such as Dijkstra algorithm is very low. To solve this problem, the researchers put forward a number of approximate search algorithms, but how to reduce the computational complexity and also keep the accuracy has been a big difficulty. According to the structural characteristics of complex networks, this article introduces regional division, improves the structure of the tree decomposition, and constructs graph into a tree to search the target vertex, getting a new the shortest path approximate algorithm for complex networks. In addition, the proposed algorithm not only reduces the computational complexity but also remains the high accuracy of approximation by examples. Key words: complex network; tree decomposition; tree-width; tree; shortest path approximate algorithm 2 1 引言 而查询时间为 O(w h) , 很显然, 其树宽和树高都对复 在图论中, 计算一对顶点之间的最短路径是一个 杂度有影响. 在此基础上, Takuya[4]等人提出了针对于 基本的图算法问题. 本文将解决的就是复杂网络中点 小树宽的复杂网络的新的最短路径查询处理方法, 其