Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Finding the detour-critical edge of a shortest path between two nodes
Information Processing Letters
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A faster computation of the most vital edge of a shortest path
Information Processing Letters
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
In an undirected, 2-node connected graph G= (V,E) with positive real edge lengths, the distance between anyt wo 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 may increase the distance from r to s. A most vital node of a given shortest path from rto 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 efficiencythe most. In this paper, we show that this problem can be solved in O(m+ nlog n) time and O(m) space, where mand n denote the number of edges and the number of nodes in G.