消除有序图中的交叉
Eliminating Crossings in Ordered Graphs
AI总结:
该研究针对有序图的书嵌入场景,提出了页数计算、边删除判定等多种参数化算法与近似方案,还拓展研究了书脊+$t$轨道绘制问题。
摘要:
在平面上绘制图并使交叉数尽可能少,是图绘制与计算几何领域的核心问题之一。另一种思路是移除最少数量的顶点或边,使剩余的图可以无交叉地绘制。我们在有序图的书嵌入场景下研究这两个问题,有序图即顶点顺序固定的图。在该场景中,顶点按给定顺序排列在一条被称为书脊的直线上,每条边必须绘制在一本书的若干书页之一上,且每条边的交叉数不超过固定值。在书嵌入中,还有另一种减少或避免交叉的方式,即使用更多的书页。绘制一个有序图且完全无交叉所需的最少书页数量,就是它的(固定顶点顺序)页数。\n我们证明,对于具有$n$个顶点和$m$条边的有序图,其页数可以在$2^m \cdot n^{O(1)}$时间内计算得到,并且可以高效计算该数值的$O(\log n)$近似解。我们可以在$2^{O(d \sqrt{k} \log (d+k))} \cdot n^{O(1)}$时间内判定:删除有序图的$k$条边后,是否足以在单页上得到$d$-平面布局(即每条边最多与$d$条其他边交叉)。作为额外参数,我们考虑了击中集的大小$h$,击中集是书脊上的一组点,使得每条边(被视为开区间)都至少包含其中一个点。当$h=1$时,我们可以高效计算出使固定顶点顺序页数达到$p$所需删除的最少边数;当$h>1$时,我们给出了关于$h+p$的XP算法。最后,我们研究了书脊+$t$轨道绘制,其中部分(而非全部)顶点位于书脊上。书脊上的顶点顺序是给定的;我们必须将每个不在书脊上的顶点映射到$t$条轨道之一,每条轨道都是单独书页上与书脊平行的直线。
英文摘要:
Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest number of vertices or edges such that the remaining graph can be drawn without crossings. We study both problems in a book-embedding setting for ordered graphs, that is, graphs with a fixed vertex order. In this setting, the vertices lie on a straight line, called the spine, in the given order, and each edge must be drawn on one of several pages of a book such that every edge has at most a fixed number of crossings. In book embeddings, there is another way to reduce or avoid crossings; namely by using more pages. The minimum number of pages needed to draw an ordered graph without any crossings is its (fixed-vertex-order) page number. We show that the page number of an ordered graph with $n$ vertices and $m$ edges can be computed in $2^m \cdot n^{O(1)}$ time. An $O(\log n)$-approximation of this number can be computed efficiently. We can decide in $2^{O(d \sqrt{k} \log (d+k))} \cdot n^{O(1)}$ time whether it suffices to delete $k$ edges of an ordered graph to obtain a $d$-planar layout (where every edge crosses at most $d$ other edges) on one page. As an additional parameter, we consider the size $h$ of a hitting set, that is, a set of points on the spine such that every edge, seen as an open interval, contains at least one of the points. For $h=1$, we can efficiently compute the minimum number of edges whose deletion yields fixed-vertex-order page number $p$. For $h>1$, we give an XP algorithm with respect to $h+p$. Finally, we consider spine+$t$-track drawings, where some but not all vertices lie on the spine. The vertex order on the spine is given; we must map every vertex that does not lie on the spine to one of $t$ tracks, each of which is a straight line on a separate page, parallel to the spine.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。