Pages that link to "Item:Q1974523"
From MaRDI portal
The following pages link to Binary de Bruijn cycles under different equivalence relations (Q1974523):
Displaying 6 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Particular cycles of a binary de Bruijn digraph (Q966168) (← links)
- Generalized de Bruijn cycles (Q1889887) (← links)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)