关于树的插入边和平均距离的一些初步结果
Some Preliminary Result About the Inset Edge and Average Distance of Trees
摘要:
图的一条附加边称为插入边。已知最小化图的平均距离的k条插入边的预测是NP-困难的。然而,当k = 1时,问题的复杂性是多项式的。在本文中,建立了一些工具的精确分析的问题的树。使用这些工具,我们可以避免使用距离矩阵。这导致更有效的算法和更好的问题分析。文中给出了该工具的几种应用,并给出了树中加入插入边时平均距离变化的一个严格界。
英文摘要:
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity of the problem is polynomial. In this paper, some tools for a precise analysis of the problem for the trees are established. Using the tools, we can avoid using the distance matrix. This leads to more efficient algorithms and a better analysis of the problem. Several applications of the tools as well as a tight bound for the change of average distance when an inset edge is added to a tree are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。