k-映射图的书嵌入
Book Embeddings of k-Map Graphs
AI总结:
该研究针对k-映射图的书嵌入问题,给出了页数为$6\lfloor k/2 \rfloor+5$的上界及对应O(kn)时间构造算法,同时给出$\lfloor 3k/4 \rfloor$的下界,并改进了1-平面图与最优2-平面图的书嵌入上界。
摘要:
映射是将球面划分为被标记为国家或孔洞的区域的一种划分方式。映射图的顶点是映射中的国家,当且仅当两个国家相邻且至少交于一点时,二者之间存在一条边。对于k-映射图,交于同一点的国家数量最多为k。若一个图可绘制在平面上且每条边的交叉数不超过k,则称其为k-平面图。图的p页书嵌入是指对图的顶点进行线性排序,并将边分配到p个页面中,使得分配到同一页面的边不存在冲突。所需的最小页面数称为图的书厚度,也称为栈数或页数。我们证明,每个k-映射图都存在一个页数为$6\lfloor k/2 \rfloor+5$的书嵌入;对于含n个顶点的图,该嵌入可从其映射出发以O(kn)的时间计算得到。我们的结果改进了已知的最优上界。在下界方面,研究表明部分k-映射图需要$\lfloor 3k/4 \rfloor$个页面。顺带地,我们还得到了改进的上界:作为4-映射图子图的1-平面图的书嵌入上界为11页,最优2-平面图的书嵌入上界为17页。
英文摘要:
A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a k-map graph, at most k countries meet in a point. A graph is k-planar if it can be drawn in the plane with at most k crossings per edge. A p-page book embedding of a graph is a linear ordering of the vertices and an assignment of the edges to p pages, so that there is no conflict for edges assigned to the same page. The minimum number of pages is the book thickness of a graph, also known as stack number or page number. We show that every k-map graph has a book embedding in $6\lfloor k/2 \rfloor+5$ pages, which, for n-vertex graphs, can be computed in O(kn) time from its map. Our result improves the best known upper bound. Towards a lower bound, it is shown that some k-map graphs need $\lfloor 3k/4 \rfloor$ pages. In passing, we obtain an improved upper bound of eleven pages for 1-planar graphs, which are subgraphs of 4-map graphs, and of 17 pages for optimal 2-planar graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。