✦ LIBER ✦

On finding the core of a tree with a specified length

✍ Scribed by Edward Minieka; Niranjani H Patel

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 291 KB
Volume: 4
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(83)90015-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Parallel algorithm for finding a core of

Parallel algorithm for finding a core of a tree network

✍ Eliezer A. Albacea 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 383 KB

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

On finding a minimum spanning tree in a

On finding a minimum spanning tree in a network with random weights

✍ Colin McDiarmid; Theodore Johnson; Harold S. Stone 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 2 views

We investigate Prim's standard ''tree-growing'' method for finding a minimum spanning tree, when applied to a network in which all degrees are about d and the edges e Ž . have independent identically distributed random weights w e . We find that when the kth ' Ž . edge e is added to the current tree

A note on the expected path length of tr

A note on the expected path length of trees with known fringe

✍ Roberto De Prisco; Giuseppe Parlati; Giuseppe Persiano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 480 KB

On the lower length of the closed-set la

On the lower length of the closed-set lattice of a tree

✍ K.M. Koh; K.S. Poh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let L(T) be the closed-set latice of a tree T. The lower length l, (L(T)) of L (T) is defined as Call a set S of vertices in T a sparse set if d(x, y)/> 3 for any two distinct vertices x, y in S. The sparsity y(T) of T is defined as y(T) = max {Isl: s is a sparse set of T}. We prove that, for any