Faster algorithms for dual-failure replacement paths
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
- A note on two problems in connexion with graphs
- Algorithms and lower bounds for replacement paths under multiple edge failure
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Automata, Languages and Programming
- Distance sensitivity oracles with subcubic preprocessing time and fast query time
- Faster matrix multiplication via asymmetric hashing
- Faster replacement paths
- Faster replacement paths and distance sensitivity oracles
- Improved distance sensitivity oracles via fast single-source replacement paths
- Multiplying matrices faster than coppersmith-winograd
- Nearly optimal approximate dual-failure replacement paths
- Negative-weight single-source shortest paths in near-linear time
- New bounds for matrix multiplication: from alpha to omega
- On the k-simple shortest paths problem in weighted directed graphs
- Powers of tensors and fast matrix multiplication
- Simplifying and unifying replacement paths algorithms in weighted directed graphs
- Subcubic equivalences between path, matrix and triangle problems
This page was built for publication: Faster algorithms for dual-failure replacement paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875163)
