Minimal Eulerian trail in a labeled digraph

Simple item page
dc.creatorMatamala, Martin
dc.creatorMoreno, Eduardo
dc.date2005-05-12
dc.date.accessioned2026-07-07T03:22:59Z
dc.date.available2026-07-07T03:22:59Z
dc.descriptionLet $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.
dc.descriptionTech. Report DIM-CMM, Universidad de Chile, August 2004
dc.identifierhttps://arxiv.org/abs/cs/0505036
dc.identifierhttp://arxiv.org/abs/cs/0505036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32769
dc.subjectDiscrete Mathematics
dc.titleMinimal Eulerian trail in a labeled digraph
dc.typetext

Files

Collections

arXiv