𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for finding the most vital edge of a minimum spanning tree

✍ Scribed by Kazuo Iwano; Naoki Katoh

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
196 KB
Volume
48
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Algorithm for Finding the Most
Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs
✍ Sudarshan Banerjee; Sanjeev Saxena πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 75 KB

Let G = (V, E) be a weighted undirected graph with n vertices and m edges; each edge e has a weight w(e) assigned to it. Let f(G) be the weight of a minimum spanning tree of G if G is connected; otherwise f(G) = ∞. The most vital edge of G is an edge e such that f(Ge) β‰₯ f(G -eβ€²) for every other edge

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