Parallel algorithm for finding the most vital edge in weighted graphs

DOI10.1006/jpdc.1997.1383zbMath0896.68065OpenAlexW2025643847MaRDI QIDQ1384523

Sanjeev Saxena, Sudarshan Banerjee

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)

Related Items (2)

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs ⋮ On finding fundamental cut sets

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