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

计算平面有向图的k-模态嵌入

Computing k-Modal Embeddings of Planar Digraphs

Juan Jose Besa, Giordano Da Lozzo, Michael T. Goodrich

摘要:

给定一个平面有向图$G$和一个正偶数$k$,如果$G$的每个顶点至多与$k$对具有相反方向的连续边相关联,则$G$在平面中的嵌入是k-模态的,即,通过嵌入至多k组具有相同方向的连续边,将每个顶点处的进入边和离开边分组。本文研究了平面有向图的$k$ -模态问题,它要求平面有向图存在$k$ -模态嵌入.这个组合问题是平面有向图和平面簇网络的各种约束嵌入问题的核心。

英文摘要:

Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is k-modal, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the outgoing edges at each vertex are grouped by the embedding into at most k sets of consecutive edges with the same orientation. In this paper, we study the $k$-Modality problem, which asks for the existence of a $k$-modal embedding of a planar digraph. This combinatorial problem is at the very core of a variety of constrained embedding questions for planar digraphs and flat clustered networks.

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

↑