Simplifying and unifying replacement paths algorithms in weighted directed graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1962826 (Why is no real title available?)
- A faster computation of the most vital edge of a shortest path
- A near-linear-time algorithm for computing replacement paths in planar directed graphs
- Algorithmic mechanism design
- Automata, Languages and Programming
- Faster replacement paths
- Faster shortest-path algorithms for planar graphs
- Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
- Finding the k Shortest Paths
- Fine-grained complexity for sparse graphs
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- Multiple-source shortest paths in planar graphs
- On the exponent of all pairs shortest path problem
- Replacement paths via fast matrix multiplication
- Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n \log^2 n)\)-time algorithm
- Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
- Solving the replacement paths problem for planar directed graphs in O(n n) time
- Subcubic equivalences between path, matrix, and triangle problems
- The k most vital arcs in the shortest path problem
Cited in
(2)
This page was built for publication: Simplifying and unifying replacement paths algorithms in weighted directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842548)
