Trees everywhere

DOI10.1007/3-540-52590-4_38MaRDI QIDQ4027617zbMATH OpenFDO

Authors Xavier Viennot

Publication date 21 February 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52590-4_38

zbMATH Keywords

algebraic languagearithmetic expressionasymptotic analysisbifurcation ratiosbranching patternscombinatorial mathematicscomputer graphicsfractalsgenerating functionsHorton-Strahler parameterhydrogeologyminimum number of registersmolecular biologymorphological structure of river networksRiemann zeta-functionsingle- stranded nucleic acidssynthetic image of trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Biochemistry, molecular biology (92C40)

Review text

[For the entire collection see Zbl 0745.00027.] ``A synthetic image of trees has been produced by an algorithm based on some combinatorial Mathematics. The combinatorics underlying the algorithm producing such trees is very rich and forms the subject of this paper. In fact the last two papers quoted above are concerned about some optimization problems in Computer science: what is the minimum number of registers needed to evaluate an arithmetic expression? Curiously this problem involves the Horton-Strahler parameter introduced in Hydrogeology.

Recommendations

• Solution of a problem of Yekutieli and Mandelbrot
• A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures
• Trees for algorithmics
• Entropy rates for Horton self-similar trees
• Trees

Cited in

(18)

• A note on the Horton-Strahler number for random trees
• A few logs suffice to build (almost) all trees. II
• Random self-similar trees and a hierarchical branching process
• Random self-similar trees: a mathematical theory of Horton laws
• On the stack-size of general tries
• On the Horton-Strahler number for random tries
• Pick a Tree – Any Tree
• scientific article; zbMATH DE number 5778173 (Why is no real title available?)
• SOME TREELIKE OBJECTS
• Universal Limit Laws for Depths in Random Trees
• scientific article; zbMATH DE number 1064787 (Why is no real title available?)
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• An open ended tree
• Tokunaga self-similarity arises naturally from time invariance
• scientific article; zbMATH DE number 1439477 (Why is no real title available?)
• Trees and gaps from a construction scheme
• The Strahler number of a parity game
• True trees are dense

This page was built for publication: Trees everywhere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027617)