Cutwidth of the de Bruijn graph (Q4359288): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On bandwidth, cutwidth, and quotient graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Area-time lower-bound techniques with applications to sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679116 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3326832 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank | |||
Normal rank |
Latest revision as of 18:22, 27 May 2024
scientific article; zbMATH DE number 1072396
Language | Label | Description | Also known as |
---|---|---|---|
English | Cutwidth of the de Bruijn graph |
scientific article; zbMATH DE number 1072396 |
Statements
Cutwidth of the de Bruijn graph (English)
0 references
8 October 1997
0 references
upper bound
0 references
cutwidth
0 references
de Bruijn graph
0 references
0 references