A class of random recursive tree algorithms with deletion

DOI10.1007/S00453-021-00859-YOpenAlexW3185721422MaRDI QIDQ2665906

Arnold T. Jr. Saunders

Publication date: 19 November 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.02720

zbMATH Keywords

generating functionssingularity analysisrecursive treesrandom deletions

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random birth-and-death networks
• Preferential deletion in dynamic models of web-like networks
• Deletions in random binary search trees: a story of errors
• A trivial algorithm whose analysis isn't
• The kernel method: a collection of examples
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• Note on the heights of random recursive trees and random m‐ary search trees
• Asymptotic degree distribution in random recursive trees
• Addition–deletion networks

This page was built for publication: A class of random recursive tree algorithms with deletion