arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.03277cs.DScs.CLcs.DM
收藏

线性时间内树的最小投射线性化

Minimum projective linearizations of trees in linear time

Quantitative Linguistics Lab, LARCA Research Group, Computer Science Department, Universitat Polit\`ecnica de Catalunya , addressline= Jordi Girona 1-3 , postcode= 08034 , city= Barcelona , country= Spain;organization= Computer Science Department, Universitat Polit\`ecnica de Catalunya , addressline= Jordi Girona 1-3 , postcode= 08034 , city= Barcelona , country= Spain

Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho

AI总结:

本文纠正了HS算法在平面情况中的错误,揭示了其与投射情况的关系,并推导出在投射和平面情况下均严格以O(n)时间运行的简单算法。

摘要:

最小线性排列问题(MLA)在于寻找一个从图的顶点到不同整数的映射π,使得∑_{ {u,v}∈E }|π(u) - π(v)|最小。在这种设定下,顶点通常被假设位于一条水平线上,边则被画为该线上方的半圆。对于树,存在多种算法可在关于n=|V|的多项式时间内解决该问题。MLA存在一些对排列施加约束的变体。Iordanskii,以及后来的Hochberg和Stallmann(HS),提出了在排列被约束为平面(也称为单页书嵌入)时解决该问题的O(n)时间算法。我们还考虑了被约束为投射(即根节点不被任何边覆盖的平面嵌入)的有根树的线性排列。Gildea和Temperley(GT)勾勒了一个用于投射排列的算法,声称其运行时间为O(n),但未提供其代价的任何证明。相反,Park和Levy声称GT的算法运行时间为O(n log d_max),其中d_max为最大度数,但未提供充分的细节。在此,我们纠正了HS算法在平面情况中的一个错误,展示了其与投射情况的关系,并推导出了在投射和平面情况下毫无疑问以O(n)时间运行的简单算法。

英文摘要:

The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $π$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|π(u) - π(v)|$. In that setting, vertices are often assumed to lie on a horizontal line and edges are drawn as semicircles above said line. For trees, various algorithms are available to solve the problem in polynomial time in $n=|V|$. There exist variants of the MLA in which the arrangements are constrained. Iordanskii, and later Hochberg and Stallmann (HS), put forward $O(n)$-time algorithms that solve the problem when arrangements are constrained to be planar (also known as one-page book embeddings). We also consider linear arrangements of rooted trees that are constrained to be projective (planar embeddings where the root is not covered by any edge). Gildea and Temperley (GT) sketched an algorithm for projective arrangements which they claimed runs in $O(n)$ but did not provide any justification of its cost. In contrast, Park and Levy claimed that GT's algorithm runs in $O(n \log d_{max})$ where $d_{max}$ is the maximum degree but did not provide sufficient detail. Here we correct an error in HS's algorithm for the planar case, show its relationship with the projective case, and derive simple algorithms for the projective and planar cases that run without a doubt in $O(n)$ time.

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

↑