Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Destruction of Very Simple Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); these form a subfamily of simply generated trees. At each stage of the process an edge is chosen at random from the tree and cut, separating the tree into two components. In the one-sided variant of the process the component not containing the root is discarded, whereas in the two-sided variant both components are kept. The process ends when no edges remain for cutting. The cost of cutting an edge from a tree of size n is assumed to be nα. Using singularity analysis and the method of moments, we derive the limiting distribution of the total cost accrued in both variants of this process. A salient feature of the limiting distributions obtained (after normalizing in a family-specific manner) is that they only depend on α.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Applied Mathematics and Statistics, The Johns Hopkins University, 3400 N. Charles St., Baltimore, MD 21218-2682, USA

    James Allen Fill

  2. Computer Science, California Institute of Technology, MC 256-80, 1200 E. California Blvd., Pasadena, CA 91125, USA

    Nevin Kapur

  3. Institut fur Diskrete Mathematik und Geometrie, Technische Universitat Wien, Wiedner Hauptstrasse 8-10/104, A-1040, Wien, Austria

    Alois Panholzer

Authors
  1. James Allen Fill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nevin Kapur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alois Panholzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to James Allen Fill, Nevin Kapur or Alois Panholzer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fill, J., Kapur, N. & Panholzer, A. Destruction of Very Simple Trees. Algorithmica 46, 345–366 (2006). https://doi.org/10.1007/s00453-006-0100-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-006-0100-1

Keywords

Search

Navigation