Matrice de ramification des arbres binaires. (Ramification matrices of binary trees) (Q809098): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On programming of arithmetic operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of registers required for evaluating arithmetic expressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average height of binary trees and other simple trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3339285 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average number of registers needed to evaluate a binary tree optimally / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Order of Random Channel Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3703700 / rank | |||
Normal rank |
Latest revision as of 18:21, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrice de ramification des arbres binaires. (Ramification matrices of binary trees) |
scientific article |
Statements
Matrice de ramification des arbres binaires. (Ramification matrices of binary trees) (English)
0 references
1991
0 references
The ramification matrices as a refinement of the Strahler number associated with each node of a binary tree were considered. The Strahler number also determines the number of registers for evaluating arithmetic expressions. The conjecture by X. G. Viennot that the ramification matrix of a binary tree takes asymptotically the form \[ \begin{matrix} \vdots \\ (1/2)\;(1/2)^ 2\;(1/2)^ 3\;...\;(1/2)^{n-1}\;(1/2)^ n \\ \vdots \end{matrix} \] at a number of tree nodes increasing to infinity was proved. The theorem was extended to the family of complete binary trees.
0 references
ramification matrices
0 references
binary tree
0 references
Strahler number
0 references