Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
We propose a method for cutting down a random recursive tree that focuses on its higher-
degree vertices. Enumerate the vertices of a random recursive tree of size n according to the …
degree vertices. Enumerate the vertices of a random recursive tree of size n according to the …
Isolating nodes in recursive trees
M Kuba, A Panholzer - Aequationes mathematicae, 2008 - Springer
We consider the number of random cuts that are necessary to isolate the node with label λ,
1≤ λ≤ n, in a random recursive tree of size n. At each stage of the edge-removal procedure …
1≤ λ≤ n, in a random recursive tree of size n. At each stage of the edge-removal procedure …
Targeted cutting of random recursive trees
We propose a method for cutting down a random recursive tree that focuses on its higher
degree vertices. Enumerate the vertices of a random recursive tree of size $ n $ according to …
degree vertices. Enumerate the vertices of a random recursive tree of size $ n $ according to …
Analysis of node isolation procedures and label-based parameters in tree structures
M Kuba - 2006 - repositum.tuwien.at
This thesis is dedicated to the analysis of node isolation procedures and labelbased
parameters in several tree models. In the first part we will analyze several algorithms for …
parameters in several tree models. In the first part we will analyze several algorithms for …