๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs

โœ Scribed by E. Dekel; J. Hu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
940 KB
Volume
20
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
โœ J.X. Hao; J.B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

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