arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.16657math.CO
收藏

终端平面网络的特征化:通过禁止结构

A characterization of terminal planar networks by forbidden structures

Waseda University(早稻田大学);University of East Anglia(东英吉利大学)

Haruki Miyaji, Yuki Noguchi, Hexuan Liu, Takatora Suzuki, Keita Watanabe, Taoyang Wu, Momoko Hayamizu

AI总结:

本文通过有限禁止结构特征化终端平面网络,并提出线性时间算法用于检测终端平面性及计算平面绘制,同时探讨其在非系统发育场景中的应用及与单源向上平面网络禁止结构问题的关联。

摘要:

终端平面网络类最近从生物视角引入,与系统发育网络可视化相关,并已建立与向上平面网络的联系。本文提供一个Kuratowski型定理,通过六个0/1标记图家族定义的有限禁止结构来特征化终端平面网络。基于超图平面性的另一种特征化方法,提供了线性时间算法用于检测终端平面性及计算此类平面绘制。我们描述了一个可能在更广泛非系统发育场景中相关的应用。我们还讨论了我们的主要结果与单源向上平面网络禁止结构问题之间的联系。

英文摘要:

The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a Kuratowski-type theorem that characterizes terminal planar networks by a finite set of forbidden structures, defined via six families of 0/1-labeled graphs. Another characterization based on planarity of supergraphs yields linear-time algorithms for testing terminal planarity and for computing such planar drawings. We describe an application that is potentially relevant in broader, non-phylogenetic settings. We also discuss a connection of our main result to an open problem on the forbidden structures of single-source upward planar networks.

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

↑