✦ LIBER ✦

A New Algorithm for Finding Trees with Many Leaves

✍ Scribed by Joachim Kneis; Alexander Langer; Peter Rossmanith

Publisher: Springer
Year: 2010
Tongue: English
Weight: 561 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9454-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new heuristic algorithm for finding mi

A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

✍ Anna Hać; Kelei Zhou 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

A Rapid Heuristic Algorithm for Finding

A Rapid Heuristic Algorithm for Finding Minimum Evolution Trees

✍ Andrew Rodin; Wen-Hsiung Li 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 69 KB

The minimum sum of branch lengths (S), or the minimum evolution (ME) principle, has been shown to be a good optimization criterion in phylogenetic inference. Unfortunately, the number of topologies to be analyzed is computationally prohibitive when a large number of taxa are involved. Therefore, sim

A sufficiently fast algorithm for findin

A sufficiently fast algorithm for finding close to optimal clique trees

✍ Ann Becker; Dan Geiger 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We offer an algorithm that finds a clique tree such that the size of the largest clique is at most (2α + 1)k where k is the size of the largest clique in a clique tree in which this size is minimized and α is the approximation ratio of an α-approximation algorithm for the 3-way vertex cut problem. W

Efficient Algorithms for Finding a Core

Efficient Algorithms for Finding a Core of a Tree with a Specified Length

✍ Shietung Peng; Win-tsung Lo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 176 KB

A core of a graph G is a path P in G that is central with respect to the property to path P. This paper presents efficient algorithms for finding a core of a tree with Ž . a specified length. The sequential algorithm runs in O n log n time, where n is the Ž 2 . Ž. size of the tree. The parallel alg

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

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