Shifted de Bruijn Graphs

DOI10.1007/978-3-319-17296-5_20zbMath1327.05154OpenAlexW2292869200MaRDI QIDQ3460465

Ragnar Freij-Hollanti

Publication date: 7 January 2016

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_20

zbMATH Keywords

exact enumerationde Bruijn graphsspanning treesstring networksEuler cycles

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Data structures (68P05)

Cites Work

• Complexity of the hamiltonian cycle in regular graph problem
• Generalized de Bruijn cycles
• Succinct de Bruijn Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Shifted de Bruijn Graphs