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
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
Finding the anti-block vital edge of a shortest path between two nodes
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Strongly polynomial-time truthful mechanisms in one shot
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Single source distance oracle for planar digraphs avoiding a failed node or link
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Real time critical edge of the shortest path in transportation networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
The impact of edge deletions on the number of errors in networks
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
Journal of Discrete Algorithms
Hi-index | 0.00 |
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 may increase 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.