scientific article

zbMATH Open0785.68092MaRDI QIDQ4027617FDOQ4027617

Xavier Viennot

Publication date: 21 February 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

asymptotic analysisgenerating functionsfractalsRiemann zeta-functioncomputer graphicsbranching patternshydrogeologymolecular biologycombinatorial mathematicsalgebraic languagearithmetic expressionbifurcation ratiosHorton-Strahler parameterminimum number of registersmorphological structure of river networkssingle- stranded nucleic acidssynthetic image of trees

Mathematics Subject Classification ID

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

Cited In (17)

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

This page was built for publication:

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