A new look at the de Bruijn graph (Q1199424): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5834367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of nonlinear de Bruijn cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal Recurring Decimals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5654066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the length of feedback shift registers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On extremal factors of the de Bruijn graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A proof of Golomb's conjecture for the de Bruijn graph / rank | |||
Normal rank |
Latest revision as of 16:15, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new look at the de Bruijn graph |
scientific article |
Statements
A new look at the de Bruijn graph (English)
0 references
16 January 1993
0 references
The author discusses various descriptions of the Good-de Bruijn graphs. In particular, he presents ``the ultimate depiction'' of these graphs, based on what he calls a cycle adjacency array.
0 references
Good-de Bruijn graphs
0 references
cycle
0 references