✦ LIBER ✦

Parallel algorithm for finding a core of a tree network

✍ Scribed by Eliezer A. Albacea

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 383 KB
Volume: 51
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00102-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Simple Optimal Parallel Algorithm for

A Simple Optimal Parallel Algorithm for a Core of a Tree

✍ S.T. Peng; W.T. Lo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin

Efficient algorithms for finding the (k,

Efficient algorithms for finding the (k, l)-core of tree networks

✍ Ronald I. Becker; Isabella Lari; Giovanni Storchi; Andrea Scozzari 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

Algorithms for a Core and k-Tree Core of

Algorithms for a Core and k-Tree Core of a Tree

✍ S.T. Peng; A.B. Stephens; Y. Yesha 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 595 KB

We first give a one-pass algorithm for finding the core of a tree. This algorithm is a refinement of the two-pass algorithm of Morgan and Slater. We then define a generalization of a core which we call a \(k\)-tree core. Given a tree \(T\) and parameter \(k\), a \(k\)-tree core is a subtree \(T^{\pr

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

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce