Minimal Eulerian circuit in a labeled digraph
Author | dc.contributor.author | Moreno, Eduardo | |
Author | dc.contributor.author | Matamala Vásquez, Martín | es_CL |
Admission date | dc.date.accessioned | 2009-05-27T17:32:44Z | |
Available date | dc.date.available | 2009-05-27T17:32:44Z | |
Publication date | dc.date.issued | 2006 | |
Cita de ítem | dc.identifier.citation | LATIN 2006: THEORETICAL INFORMATICS Book Series: LECTURE NOTES IN COMPUTER SCIENCE Volume: 3887 Pages: 737-744 Published: 2006 | en |
Identifier | dc.identifier.issn | 0302-9743 | |
Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/124941 | |
Abstract | dc.description.abstract | Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem of finding an Eulerian circuit of lexicographically minimal label among all Eulerian circuits of the graph. We prove that this problem is NP-hard by showing a reduction from the DIRECTED-HAMILTONIAN-CIRCUIT problem. If the labeling of the arcs is such that. arcs going out from the same vertex have different labels, the problem can be solved in polynomial time. We present an algorithm to construct the unique Eulerian circuit of lexicographically minimal label starting at a fixed vertex. Our algorithm is a recursive greedy algorithm which runs in O(vertical bar A vertical bar) steps. We also show an application of this algorithm to construct the minimal De Bruijn sequence of a language. | en |
Lenguage | dc.language.iso | en | en |
Publisher | dc.publisher | SPRINGER-VERLAG BERLIN | en |
Keywords | dc.subject | DE-BRUIJN | en |
Título | dc.title | Minimal Eulerian circuit in a labeled digraph | en |
Document type | dc.type | Artículo de revista |
Files in this item
This item appears in the following Collection(s)
-
Artículos de revistas
Artículos de revistas