Parallel algorithm for finding the most vital edge in weighted graphs

DOI10.1006/JPDC.1997.1383MaRDI QIDQ1384523zbMATH OpenOpenAlexFDO

Authors Sudarshan Banerjee, Sanjeev Saxena

Publication date 1 October 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1383

zbMATH Keywords

weighted undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)

Cited in

(5)

• Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗
• The most vital edges of matching in a bipartite graph
• On finding fundamental cut sets

This page was built for publication: Parallel algorithm for finding the most vital edge in weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384523)