Protected points in ordered trees

DOI10.1016/J.AML.2007.07.001zbMATH Open1138.05308OpenAlexW2039053128MaRDI QIDQ2425405FDOQ2425405

Authors: Gi-Sang Cheon, Louis W. Shapiro 

Publication date: 5 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.aml.2007.07.001

Recommendations

• Weakly protected points in ordered trees
• Protected points in \(k\)-ary trees
• Protected nodes and fringe subtrees in some random trees
• \(k\)-protected vertices in unlabeled rooted plane trees
• Enumeration of protected nodes in Motzkin trees

zbMATH Keywords

Catalan numberordered treeMotzkin numberscentral binomial coefficient\(\{0, 1, 2\}\)-treesfine numberprotected point

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Title not available (Why is that?)
• Asymptotic Methods in Enumeration
• A survey of the Fine numbers
• A bijection between ordered trees and 2-Motzkin paths and its many consequences

Cited In (25)

• \(k\)-protected vertices in binary search trees
• Notes on protected nodes in digital search trees
• Protected points in \(k\)-ary trees
• Protected cells in compositions
• Asymptotic distribution of two-protected nodes in random binary search trees
• The uplift principle for ordered trees
• Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes
• Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
• On 2-protected nodes in random digital trees
• \(k\)-protected vertices in unlabeled rooted plane trees
• On the peel number and the leaf-height of Galton–Watson trees
• Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
• The hitting time subgroup, Łukasiewicz paths and Faber polynomials
• PICK TWO POINTS IN A TREE
• Weakly protected points in ordered trees
• The distribution of the maximum protection number in simply generated trees
• Summations on the diagonals of a Riordan array and some applications
• Protected Branches in Ordered Trees
• Protection numbers in simply generated trees and Pólya trees
• Pattern avoidance in parking functions
• Protection number in plane trees
• Title not available (Why is that?)
• Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
• Protected Vertices in Motzkin trees
• DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION

This page was built for publication: Protected points in ordered trees

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