Articles
Tree partitioning via vertex deletion☆

https://doi.org/10.1016/S1571-0653(05)80074-5Get rights and content

Abstract

Motivated by tree partitioning problems, we introduce the notion of i-divider of a tree, t-dividers generalize concepts well-known in literature, such as centroids and separators, that are the backbone of tree decomposition algorithms based on vertex deletion. We characterize the structure of the set of t-dividers of a tree and we present an efficient algorithm for finding t-dividers that is able to avoid visiting the entire tree

References (14)

  • R.I. Becker et al.

    The shifting algorithm technique for the partitioning of trees

    Discrete Applied Mathematics

    (1995)
  • A.N.C. Kang et al.

    Some properties of a centroid of a free tree

    Information Processing Letters

    (1975)
  • R.I. Becker et al.

    How to make a polynomial movie from pseudopolynomially many frames: A continuous shifting algorithm for tree partitioning

    Proc. of Fun With Algorithms (FUN'98)

    (1998)
  • R.R. Benkoczi et al.

    Spine Tree Decomposition, Technical Report TR 1999-09, School of Computing Science, Simon Fraser University

    (1999)
  • F. Buckley et al.

    Distance in Graphs

    (1990)
  • R. Chandrasekaran et al.

    An O((n.log(p))2) algorithm for continuous p-center on a tree

    SIAM Journal on Algebraic and Discrete Mathematics

    (1980)
There are more references available in the full text version of this article.

Cited by (0)

☆

Work partially supported by the project “Algorithms for Large Data Sets: Science and Engineering” of the Italian Ministry of University and of Scientific and Technological Research.

View full text
Copyright © 2004 Elsevier Ltd. All rights reserved.