𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple algorithm for finding the center of a tree

✍ Scribed by A. B. Murdasov

Publisher
Springer US
Year
1976
Tongue
English
Weight
92 KB
Volume
12
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A self-stabilizing algorithm which finds
A self-stabilizing algorithm which finds a 2-center of a tree
✍ Tetz C. Huang; Ji-Cherng Lin; Hsueh-Jen Chen πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 884 KB

In this paper, we design a self-stabilizing algorithm which finds a 2-center for a distributed system with a tree topology. Our algorithm is based on the algorithm in [1][2][3]. The latter enables us to find the center (or centers) for the tree. If we sever the tree at the center (or centers), we ob

A combinatorial description of the close
A combinatorial description of the closest tree algorithm for finding evolutionary trees
✍ Michael D. Hendy πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 382 KB

The closest tree algorithΒ’a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
✍ Akiyoshi Shioura; Takeaki Uno πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 173 KB

Given a tree containing n vertices, consider the sum of the distance between all Ε½ . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t