𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the most vital arcs in a network

✍ Scribed by Michael O. Ball; Bruce L. Golden; Rakesh V. Vohra

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
256 KB
Volume
8
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Determining the most vital link in a flo
Determining the most vital link in a flow network
✍ S. H. Lubore; H. D. Ratliff; G. T. Sicilia πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 356 KB

The most vital link in a single commodity flow network is that arc whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the networ

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