Minimal Eulerian trail in a labeled digraph

Details Minimal Eulerian trail in a labeled digraph Minimal Eulerian trail in a labeled digraph

2005-05-12

arxiv.org/abs/cs/0505036v1

Computer Science

Discrete Mathematics

Tech. Report DIM-CMM, Universidad de Chile, August 2004

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimal Eulerian trail in a labeled digraph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal Eulerian trail in a labeled digraph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Eulerian trail in a labeled digraph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650044