arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.2835cs.CG
收藏

平面刚性的快速算法

Faster Algorithms for Rigidity in the Plane

Sergey Bereg

摘要:

文[1]提出了一种新的刻画Laman图的结构--红-黑层次图,并给出了计算它的算法。对于一个有n个顶点的Laman图G=(V,E),如果给定(V,E+e)的一个划分为两棵生成树,则它的时间复杂度为O(n^2)。我们表明,一个简单的修改减少了运行时间为O(n \log n)。使用Gabow和Westermann [2]提出的将图划分为两个森林的算法,总的运行时间可以减少到O(n \sqrt{n\log n})。红-黑谱系的存在性是图是Laman图的一个充分必要条件。然后,修改构建红黑树的算法,使其同时识别拉曼图。

英文摘要:

In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G=(V,E) with n vertices it runs in O(n^2) time assuming that a partition of (V,E+e) into two spanning trees is given. We show that a simple modification reduces the running time to O(n\log n). The total running time can be reduced O(n\sqrt{n\log n}) using the algorithm by Gabow and Westermann [2] for partitioning a graph into two forests. The existence of a red-black hierarchy is a necessary and sufficient condition for a graph to be a Laman graph. The algorithm for constructing a red-black hierarchy can be then modified to recognize Laman graphs in the same time.

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

↑