Faster Algorithms for All Pairs Non-Decreasing Paths Problem
From MaRDI portal
Publication:5091202
Recommendations
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- A simple approach to nondecreasing paths
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- scientific article; zbMATH DE number 219247
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 5899282 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A note on two problems in connexion with graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Letter to the editor: A variant on the shortest-route problem
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Multiplying matrices faster than coppersmith-winograd
- Powers of tensors and fast matrix multiplication
- Quantum algorithms for matrix products over semirings
Cited in
(2)
This page was built for publication: Faster Algorithms for All Pairs Non-Decreasing Paths Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091202)
