A-order generation of k-ary trees with a 4k–4 letter alphabet (Q4718611): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A loopless algorithm for generating binary tree sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating t-ary trees in A-order / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Loopless generation of \(k\)-ary tree sequences / rank | |||
Normal rank | |||
Latest revision as of 15:07, 24 May 2024
scientific article; zbMATH DE number 954565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A-order generation of k-ary trees with a 4k–4 letter alphabet |
scientific article; zbMATH DE number 954565 |
Statements
A-order generation of k-ary trees with a 4k–4 letter alphabet (English)
0 references
9 June 1997
0 references
\(k\)-ary trees
0 references
