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

欧拉回路中的简单性:唯一性与安全性

Simplicity in Eulerian Circuits: Uniqueness and Safety

Nidia Obscura Acosta, Alexandru I. Tomescu

AI总结:

本文针对有向图唯一欧拉回路检测问题,提出基于底层无向图割点的线性时间可检查刻画,并在线性时间内计算所有极大 safe 游走,改进了此前依赖 BEST 定理或 Pevzner 刻画的多项式时间方法。

摘要:

有向图中的欧拉回路是图论中最基本的概念之一。检测图 $G$ 是否具有唯一欧拉回路可以在多项式时间内完成,方法包括 de Bruijn、van Aardenne-Ehrenfest、Smith 和 Tutte 于 1941-1951 年提出的 BEST 定理(涉及计数树形图),或 Pevzner 于 1989 年提出的定制化刻画(涉及计算 $G$ 的简单环的交图),这两种方法都依赖于对更简单的唯一性问题而言过于复杂的概念。在本文中,我们给出了具有唯一欧拉回路的有向图的一种新的线性时间可检查刻画。该刻画基于一个简单条件,即两条边何时必须在所有欧拉回路中连续出现,该条件用 $G$ 的底层无向图的割点来表述。作为副产品,我们还可以在线性时间内计算出现在所有欧拉回路中的所有极大 $\ extit{safe}$ 游走,对此 Nagarajan 和 Pop 在 2009 年基于 Pevzner 刻画提出了一个多项式时间算法。

英文摘要:

An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph $G$ has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, 1941-1951 (involving counting arborescences), or via a tailored characterization by Pevzner, 1989 (involving computing the intersection graph of simple cycles of $G$), both of which thus rely on overly complex notions for the simpler uniqueness problem. In this paper we give a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. This is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of $G$. As a by-product, we can also compute in linear-time all maximal $\textit{safe}$ walks appearing in all Eulerian circuits, for which Nagarajan and Pop proposed in 2009 a polynomial-time algorithm based on Pevzner characterization.

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

↑