Parallel Algorithm for Finding the Most
β
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