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

约束双边循环图布局中的最小交叉问题

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts

Fabian Klute, Martin Nöllenburg

摘要:

圆形布局是一种流行的图形绘制样式,其中顶点放置在圆上,边绘制为直弦。圆形布局中的交叉最小化是\NP -困难的。在实践中,允许更少交叉的一种方法是双面布局,在圆的外部绘制一些边缘作为曲线。事实上,单面和双面圆形布局相当于单页和双页的书籍图纸,即,所有顶点都放在一条线(脊)上,边画在由脊限定的一个或两个不同的半平面(页面)上的图形布局。在本文中,我们研究的问题,最小化的交叉为一个固定的循环顶点的顺序,通过计算一个最佳的$k$ -平面集的外部绘制的边缘$k \ge 1$,以前研究的情况$k=0$。我们发现,这涉及到找到有界度最大重量诱导子图的圆图,这是一个图论问题的独立利益。我们证明了\NP -硬度为任意$k$,提出了一个有效的算法$k=1$,并推广到一个显式的\XP -时间算法为任何固定的$k$。对于实际上有趣的情况下$k=1$,我们实现了我们的算法,并提出实验结果,证实了我们的算法的适用性。

英文摘要:

Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine. In this paper we study the problem of minimizing the crossings for a fixed cyclic vertex order by computing an optimal $k$-plane set of exteriorly drawn edges for $k \ge 1$, extending the previously studied case $k=0$. We show that this relates to finding bounded-degree maximum-weight induced subgraphs of circle graphs, which is a graph-theoretic problem of independent interest. We show \NP-hardness for arbitrary $k$, present an efficient algorithm for $k=1$, and generalize it to an explicit \XP-time algorithm for any fixed $k$. For the practically interesting case $k=1$ we implemented our algorithm and present experimental results that confirm the applicability of our algorithm.

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

↑