Bandwidth of the complete \(k\)-ary tree (Q1896357): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127098633, #quickstatements; #temporary_batch_1722788207324 |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Q686169 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Rainer Bodendiek / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3803160 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127098633 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:18, 4 August 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
