Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V,E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in G. The removal of a node and its incident edges from G mayincrease the distance from r to s. A most vital node of a given shortest path from r to s is a node (other than r and s) whose removal from G results in the largest increase of the distance from r to s. In the past, the problem of finding a most vital node of a given shortest path has been studied because of its implications in network management, where it is important to know in advance which component failure will affect network efficiency the most. In this paper, we show that this problem can be solved in O(m + n log n) time and O(m) space, where m and n denote the number of edges and the number of nodes in G.
KeywordsShort Path Incident Edge Node Failure Short Path Tree Short Path Tree
Unable to display preview. Download preview PDF.
- 2.A. Bar-Noy, S. Khuller and B. Schieber, The complexity of finding most vital arcs and nodes. TR CS-TR-3539, Institute for Advanced Studies, Universityof Maryland, College Park, MD, 1995.Google Scholar
- 8.E. Nardelli, G. Proietti and P. Widmayer, A faster computation of the most vital edge of a shortest path between two nodes, Info. Proc. Letters, to appear. Also available as TR 15-99, Dipartimento di Matematica Pura ed Applicata, University of L’Aquila, L’Aquila, Italy, April 1999.Google Scholar
- 9.N. Nisan, Algorithms for selfish agents, Proc. of the 16th Symp. on Theoretical Aspects of Computer Science (STACS’99), Lecture Notes in Computer Science, Vol. 1563, Springer, (1999) 1–15.Google Scholar
- 10.N. Nisan and A. Ronen, Algorithmic mechanism design, Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC’99), (1999) 129–140.Google Scholar
- 11.J.S. Rosenschein and G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, Cambridge, Massachusetts, 1994.Google Scholar
- 13.S. Venema, H. Shen and F. Suraweera, A parallel algorithm for the single most vital vertex problem with respect to single source shortest paths, Online Proc. of the First Int. Conf. on Parallel and Distributed Computing, Applications and Technologies (PDCAT’2000), Chapter 22, http://www2.comp.polyu.edu.hk/PDCAT2000/publish.html.