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

嵌入图的距离测度

Distance Measures for Embedded Graphs

Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk

摘要:

我们引入新的距离措施比较直线嵌入图的基础上的Fréchet距离和弱Fréchet距离。这些图的距离定义使用连续映射,从而考虑到组合结构以及几何嵌入的图形。我们提出了一个通用的算法方法来计算这些图的距离。虽然我们表明,决定的距离是NP-困难的一般嵌入图,我们证明了我们的方法产生多项式时间算法,如果图是树,和弱Fréchet距离的基础上的距离,如果图是平面嵌入。此外,我们证明,决定的距离的基础上的Fréchet距离仍然是NP-难的平面嵌入图,并显示我们的一般算法方法如何产生指数时间算法和多项式时间近似算法这种情况下。

英文摘要:

We introduce new distance measures for comparing straight-line embedded graphs based on the Fréchet distance and the weak Fréchet distance. These graph distances are defined using continuous mappings and thus take the combinatorial structure as well as the geometric embeddings of the graphs into account. We present a general algorithmic approach for computing these graph distances. Although we show that deciding the distances is NP-hard for general embedded graphs, we prove that our approach yields polynomial time algorithms if the graphs are trees, and for the distance based on the weak Fréchet distance if the graphs are planar embedded. Moreover, we prove that deciding the distances based on the Fréchet distance remains NP-hard for planar embedded graphs and show how our general algorithmic approach yields an exponential time algorithm and a polynomial time approximation algorithm for this case.

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

↑