标号有向图的最小欧拉迹
Minimal Eulerian trail in a labeled digraph
摘要：
设$G$是一个欧拉有向图，它具有一个弧标号，使得从同一顶点出发的弧具有不同的标号.在这项工作中，我们提出了一个算法来构建欧拉轨迹开始在任意顶点$v$的最小字典的标签之间的标签的欧拉轨迹开始在这个顶点。我们还展示了该算法的应用，以构造语言的最小de Bruijn序列。
英文摘要：
Let $G$ be an Eulerian directed graph with an arc-labeling such that arcs going out from the same vertex have different labels. In this work, we present an algorithm to construct the Eulerian trail starting at an arbitrary vertex $v$ of minimum lexicographical label among labels of all Eulerian trails starting at this vertex. We also show an application of this algorithm to construct the minimal de Bruijn sequence of a language.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
