Abstract
In this paper, wepresent an extension of Strahler numbers to rooted plane trees. Several asymptotic properties are proved; others are conjectured. We also describe several applications of this extension.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Auber. Outils de visualisation de larges structures de données. PhD dissertation, Université Bordeaux 1, 2002.
D. Auber. Using strahler numbers for real time visual exploration of huge graphs. InInternational Conference on Computer Vision and Graphics, volume 1,3 ofJournal of WSCGpages 56–69, 2002.
D. Auber. Tulip: A huge graph visualisation framework. In P. Mutzel and M. Jünger, editorsGraph Drawing SoftwaresMathematics and Visualization, pages 105–126. Springer-Verlag, 2003.
D. Auber, M. Delest, J.P. Domenger, P. Ferraro, and R. Strandh. EVAT: Environment for visualization and analysis of trees. InIEEE Symposition on InformationtlVisualisation Contestvolume https://www.cs.umd.edu/hcil/iv03contest https://www.cs.umd.edu/hcil/iv03contest pages 124–126, 2003.
J. Bourdon, M. Nebel, and B. Vallée. On the stack-size of general tries.Theoretical Informatics and Applications35(4):163–185, 2000.
A.P. Ershov. On programming of arithmetic operations.Communication of the A.C.M1(8):3–6, 1958.
P. Flajolet and A. Odlyzko. Singularity analysis of generating functions.SIAM J. Discrete Math.3:216–240, 1990.
P. Flajolet, J.C. Raoult, and J. Vuillemin. The number of registers required for evaluating arithmetic expressions.Theoretical Computer Science9:99–125, 1979.
P. Flajolet and R. SedgewickThe average case analysis of algorithms: Complex asymptotics and generating functions. Rapport de recherche 2026, INRIA, 1993.
J. Françon. Sur le nombre de registres nécessaires à l’évaluation d’une expression arithmétique.RAIRO Informatique théorique, 18:355–364, 1984.
R.E. Horton. Erosioned development of systems and their drainage basins, hydrophysical approach to quantitative morphomology.Bulletin Geological Society of America56:275–370, 1945.
R. Kemp. The average number of registers needed to evaluate a binary tree optimally.Acta Informatica11:363–372, 1979.
A. Meir and J. W. Moon. Erratum: On an asymptotic method in enumeration“.J. Combin. Theory Ser.A, 52(1):163, 1989.
A. Meir and J. W. Moon. On an asymptotic method in enumeration.J. Combin. Theory Ser.A, 51(1):77–89, 1989.
W.J. Moon. An extension of Horton’s law of stream numbers. Math. Colloq. Univ. cape Town, 1980.
M.E. Nebel. A unified approach to the analysis of Horton-Strahler parameters of binary tree structures.Random Struct. Algorithms21(3–4):3–4, 2002.
M. Rodeh Y. Dinitz, A. Itai. On an algorithm of Zemlyachenko for subtree isomorphism.Information Processing Letters703:141–146, 1999.
R. Shreve. Statistical law of stream numbers.J. Geol.74:178–186, 1966.
A.N. Strahler. Hypsomic analysis of erosional topography.Bulletin Geological Society of America63:1117–1142, 1952.
J. Vannimenus and X.G. Viennot. Combinatorial analysis of ramified patterns.J. Stat. Phys.54:1529–1538, 1989.
G. Viennot. Trees everywhere. In A. Arnold, editorColloquium on Trees in Algebra and ProgrammingLecture Notes in Computer Science 431, pages 18–41. Springer-Verlag, 1990.
G. Viennot, G. Eyrolles, N. Janey, and D.Arques. Combinatorial analysis of ramified patterns and computer imagery of trees. InSIGGRAPH Conferencevolume 23 ofComputer Graphicspages 31–40, 1989.
X.G. Viennot. A Strahler bijection between Dyck paths and planar trees. In R. Cori and O. Serra, editors11th Formal Power Series and Algebraic Combinatoricspages 573–584, 1999.
G.J. Wills. NicheWorks: Interactive visualization of very large graphs. In Giuseppe Di Battista, editor5thSymp. Graph Drawing,volume 1353 of Lecture Notes in Computer Science, pages 403–414. Springer-Verlag, 1997.
D. Zeilberger. A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number.Discrete Math.82:89–92, 1990.
V.N. Zemlyachenko. Determining tree isomorphism.Seminar on Combinatorial Mathematicspages 54–60, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Auber, D., Domenger, JP., Delest, M., Duchon, P., Fédou, JM. (2004). New Strahler Numbers for Rooted Plane Trees. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds) Mathematics and Computer Science III. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7915-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7915-6_21
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9620-7
Online ISBN: 978-3-0348-7915-6
eBook Packages: Springer Book Archive