Minimal Eulerian trail in a labeled digraph
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2005
- DOI:
- 10.48550/arXiv.cs/0505036
- arXiv:
- arXiv:cs/0505036
- Bibcode:
- 2005cs........5036M
- Keywords:
-
- Discrete Mathematics
- E-Print:
- Tech. Report DIM-CMM, Universidad de Chile, August 2004