Bandwidth of the complete \(k\)-ary tree (Q1896357): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3803160 / rank | |||
Normal rank | |||
Revision as of 15:59, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bandwidth of the complete \(k\)-ary tree |
scientific article |
Statements
Bandwidth of the complete \(k\)-ary tree (English)
0 references
27 August 1995
0 references
The author succeeds in determining the bandwidth \(B(T_{k,d})\) of the complete \(k\)-ary tree \(T_{k,d}\) on \(d\) levels, \(k,d\in \mathbb{N}\). The proof is constructive and done by rectifying a known algorithm of Chung (1988).
0 references
bandwidth
0 references
complete \(k\)-ary tree
0 references
algorithm of Chung
0 references
