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

用于优势绘制的小超模式

Small Superpatterns for Dominance Drawing

Michael J. Bannister, William E. Devanny, David Eppstein

摘要:

我们利用有向无环图和排列的优势图纸之间的连接,在两个方向上,提供改进的边界上的通用点集的大小为某些类型的优势图纸和超模式的某些自然类的排列。特别地,我们证明了宽度为2的偏序图的控制图存在泛点集,大小为O(n^{3/2})的st-外平面图的控制图存在泛点集,大小为O(n \log n)的有向树的控制图存在泛点集.我们证明了321-避免排列具有大小为O(n^{3/2})的超模式,riffle排列(321-,2143-和2413-避免排列)具有大小为O(n)的超模式,riffle序列及其逆序列的级联具有大小为O(n \log n)的超模式。我们的分析包括在这些界限的领先常数的计算。

英文摘要:

We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain natural classes of permutations. In particular we show that there exist universal point sets for dominance drawings of the Hasse diagrams of width-two partial orders of size O(n^{3/2}), universal point sets for dominance drawings of st-outerplanar graphs of size O(n\log n), and universal point sets for dominance drawings of directed trees of size O(n^2). We show that 321-avoiding permutations have superpatterns of size O(n^{3/2}), riffle permutations (321-, 2143-, and 2413-avoiding permutations) have superpatterns of size O(n), and the concatenations of sequences of riffles and their inverses have superpatterns of size O(n\log n). Our analysis includes a calculation of the leading constants in these bounds.

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

↑