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

DOI10.1016/0167-8191(92)90061-BzbMath0795.68087OpenAlexW2034581303MaRDI QIDQ1201944

Lih-Hsing Hsu, Chu-Tao Wu, Peng-fei Wang

Publication date: 17 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90061-b

zbMATH Keywords

weighted graphminimum spanning treecost-optimal parallel algorithmsvital edge

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (4)

NC algorithms for the Single Most Vital Edge problem with respect to shortest paths ⋮ Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs ⋮ Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) ⋮ Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗

This page was built for publication: Parallel algorithms for finding the most vital edge with respect to minimum spanning tree