Protected points in k-ary trees
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- \(k\)-protected vertices in unlabeled rooted plane trees
- Weakly protected points in ordered trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Protected points in ordered trees
- k-protected vertices in binary search trees
- Notes on protected nodes in digital search trees
- Protection number in plane trees
- Protected vertices in Motzkin trees
- Protected cells in bargraphs
- Degree profile of m-ary search trees: a vehicle for data structure compression
- Protected Branches in Ordered Trees
- On the peel number and the leaf-height of Galton–Watson trees
- On 2-protected nodes in random digital trees
- Protection numbers in simply generated trees and Pólya trees
- The distribution of the maximum protection number in simply generated trees
- Asymptotic distribution of two-protected nodes in random binary search trees
- Characterization of trees with maximum security
- Protected cells in compositions
This page was built for publication: Protected points in \(k\)-ary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617014)