Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)

DOI10.1016/0166-218X(91)90028-UzbMath0732.05038OpenAlexW1975956517MaRDI QIDQ809098

Jean-Guy Penaud

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90028-u

zbMATH Keywords

binary treeramification matricesStrahler number

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

A note on the Horton-Strahler number for random binary search trees ⋮ Hypermap rewriting: A combinatorial approach ⋮ On the Horton-Strahler number for random tries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average height of binary trees and other simple trees
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• On programming of arithmetic operations
• On the Order of Random Channel Networks

This page was built for publication: Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)