Name
Abstract | ||
|---|---|---|
Abstract Let G be an Eulerian directed graph with an arc-labeling. In this work we present an algorithm to construct the Eulerian trail starting at a 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. Key words: Eulerian graphs, labeled digraph, de Bruijn sequence |
Year | Venue | Keywords |
|---|---|---|
2005 | Clinical Orthopaedics and Related Research | eulerian graph,directed graph,de bruijn sequence,discrete mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,BEST theorem,Vertex (geometry),Vertex (graph theory),Route inspection problem,Eulerian path,De Bruijn graph,Cycle space,De Bruijn sequence,Mathematics | Journal | abs/cs/050 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Matamala | 1 | 158 | 21.63 |
| Eduardo Moreno | 2 | 0 | 0.34 |