Isolating nodes in recursive trees

DOI10.1007/S00010-008-2929-7zbMATH Open1180.05031OpenAlexW2073102954MaRDI QIDQ998742FDOQ998742

Authors: Markus Kuba, Alois Panholzer 

Publication date: 29 January 2009

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-008-2929-7

Recommendations

• Multiple isolation of nodes in recursive trees
• scientific article; zbMATH DE number 4193688
• Publication:4939531
• The isolated vertices of trees
• scientific article; zbMATH DE number 3978405
• Recursion on Homogeneous Trees
• scientific article; zbMATH DE number 1552323
• Solving non-homogeneous nested recursions using trees
• On eliminating vertices from a tree
• Tree decomposition of graphs

zbMATH Keywords

limiting distributionrecursive treescutting-down procedureisolating nodesnumber of random cuts

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cited In (11)

• Multiple isolation of nodes in recursive trees
• Cutting edges at random in large recursive trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Isolating the most recent entry in a random recursive tree by random cuts
• Title not available (Why is that?)
• On moment sequences and mixed Poisson distributions
• Cutting down trees with a Markov chainsaw
• Isolating a leaf in rooted trees via random cuttings
• The cut-tree of large recursive trees
• A modification of the random cutting model

This page was built for publication: Isolating nodes in recursive trees

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