✦ LIBER ✦

Parallel algorithms for finding the most vital edge with respect to minimum spanning tree

✍ Scribed by Lih-Hsing Hsu; Peng-Fei Wang; Chu-Tao Wu

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 1015 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90061-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the most vital edge with respect

Finding the most vital edge with respect to minimum spanning tree in weighted graphs

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Efficient algorithms for finding the mos

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

✍ Kazuo Iwano; Naoki Katoh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 196 KB

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

Finding the most vital edge with respect

Finding the most vital edge with respect to K-terminal reliability in series-parallel networks: Peng-Fei Wangd and Lih-Hsing Hsu. Computers and Industrial Engineering, 25(1), 457 (1993)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 108 KB