arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.05119cs.DMcs.DS
收藏

直径为3的图的平均最短路长

Average Shortest Path Length of Graphs of Diameter 3

Nobutaka Shimizu, Ryuhei Mori

摘要:

具有低平均最短路径长度(ASPL)的网络拓扑提供高效的数据传输,而节点的数量和入射到每个节点的链路的数量通常由于物理约束而受到限制。在本文中,我们考虑使用随机局部搜索(SLS)算法在这些约束下的低ASPL图的建设。由于ASPL不能有效地计算,ASPL不适合SLS算法的评价函数。我们首先推导出直径为3的图的ASPL的一个等式和界。然后,我们建议使用由图中三角形和正方形的数量表示的最小上界作为直径为3的图的评价函数。通过使用一些数据表,我们证明了当节点数和最大度趋于无穷大时,所提出的评价函数可以在O(1)时间内得到评价。利用模拟退火算法和所提出的评价函数,构造了直径为3、节点数为10 000的低ASPL正则图.

英文摘要:

A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are often limited due to physical constraints. In this paper, we consider the construction of low ASPL graphs under these constraints by using stochastic local search (SLS) algorithms. Since the ASPL cannot be calculated efficiently, the ASPL is not suitable for the evaluation function of SLS algorithms. We first derive an equality and bounds for the ASPL of graphs of diameter 3. Then, we propose use the simpliest upper bound represented by the number of triangles and squares in the graph as an evaluation function for graphs of diameter 3. We show that the proposed evaluation function can be evaluated in O(1) time as the number of nodes and the maximum degree tend to infinity by using some data tables. By using the simulated annealing with the proposed evaluation function, we construct low ASPL regular graphs of diameter 3 with 10 000 nodes.

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

↑