Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Improved Distance Oracles for Avoiding Link-Failure
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Solving the replacement paths problem for planar directed graphs in O(n log n) time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
For a directed graph G we consider queries of the form: "What is the shortest path distance from vertex x to vertex y in G avoiding a failed link (u, v), and what edge leaving x should we use to get on a such a shortest path?" We show that an oracle for such queries can be stored in O(n2 log n) space with a query time of O(log n). No non-trivial solution was known for this problem.