Pages that link to "Item:Q5597538"
From MaRDI portal
The following pages link to The lexicographically least de Bruijn cycle (Q5597538):
Displayed 10 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- Longest subsequences shared by two de Bruijn sequences (Q780381) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Constructive theorems for the truth table of the Ford sequence (Q2546349) (← links)
- Generation of the Ford sequence of length \(2^ n\), n large (Q2550021) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)