Minimum Eulerian circuits and minimum de Bruijn sequences
From MaRDI portal
Publication:1044891
DOI10.1016/j.disc.2007.11.027zbMath1207.05071WikidataQ57707486 ScholiaQ57707486MaRDI QIDQ1044891
Martin Matamala, Eduardo Moreno
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.027
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- de Bruijn sequences and de Bruijn graphs for a general language
- Universal cycles for combinatorial structures
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Minimal Eulerian Circuit in a Labeled Digraph
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Generating necklaces
- Graph-Theoretic Concepts in Computer Science
- On Unicursal Paths in a Network of Degree 4
- Normal Recurring Decimals