Abstract
For a weighted, undirected graph G = (V, E) where |V| = n and |E| = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths (APSP). The first measurement considers only the impact of the removal of a single edge from the APSP on the shortest distance between each vertex pair. The second considers the total weight of all the edges which make up the APSP, that is, calculate the sum of the distance between each vertex pair after the deletion of a tree edge. We give a sequential algorithm for this problem, and show how to obtain an NC algorithm running in O(log n) time using mn 2 processors and O(mn 2) space on the MINIMUM CROW PRAM. Given the shortest distance between each pair of vertices u and v, the diameter of the graph is defined as the longest of these distances. The Most vital edge with respect to the diameter is the edge lying on such a u - v shortest path which when removed causes the greatest increase in the diameter. We show how to modify the above algorithm to solve this problem using the same time and number of processors. Both algorithms compare favourably with the straightforward solution which simply recalculates the all pairs shortest path information.
Preview
Unable to display preview. Download preview PDF.
References
A. Bar-Noy, S. Khuller, and B. Schieber. The complexity of fording most vital arcs and nodes. Technical Report CS-TR-3539, University of Maryland Institute for Advanced Studies, College Park (1995).
W.G. Brown. Reviews in graph theory. American Mathematical Society, Providence, RI (1980).
N. Deo and A. Pan. Shortest Path Algorithms: Taxonomy and Annotation. Networks 14 (1984), 275–323.
J. Ho, D.T. Lee, C. Chang, and C.K. Wong. Minimum diameter spanning trees and related problems. SIAM J. Comput. Vol. 20 No. 5 (1991), 987–997.
J. Jájá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, Mass., 1992.
J. Katajainen and J.L. Träff. Simple parallel algorithms for the replacement edge problem and related problems on minimum spanning trees. Technical Report DIKU-94/18, Department of Computer Science, University of Copenhagen, 1994.
K. Malik, A.K. Mittal and S.K. Gupta. The k most vital edges in the shortest path problem. Oper. Res. Lett. 8 (1989), 223–227.
H. Shen. Improved parallel algorithms for finding the most vital edge of a graph with respect to a minimum spanning tree. Technical Report, School of Computing and Information technology, Griffith University, Australia, URL: http://www.cit.gu.edu.au/research/reports (1996).
R.E. Tarjan. Sensitivity analysis of minimum spanning trees and shortest path trees. IPL 14 (1982), 30–33.
S. Venema, H. Shen and F. Suraweera, NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Paths, IPL 60 (1996), 243–248. *** DIRECT SUPPORT *** A0008D07 00016
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venema, S., Shen, H., Suraweera, F. (1998). NC algorithms for the single most vital edge problem with respect to all pairs shortest paths. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_720
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_720
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive