most citedMinimal Eulerian trail in a labeled digraph

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2007

Minimum de Bruijn Sequence in a Language with Forbidden Substrings

Eduardo Moreno, Martin Matamala

Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app…

cs.DM2005★ 1 cited

Minimal Eulerian trail in a labeled digraph

Martin Matamala, Eduardo Moreno

Let 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 t…