Faster Algorithms for All Pairs Non-Decreasing Paths Problem
From MaRDI portal
Publication:5091202
DOI10.4230/LIPICS.ICALP.2019.48OpenAlexW2964976529MaRDI QIDQ5091202FDOQ5091202
Authors: Ran Duan, Ce Jin, Hongxun Wu 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.10701
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 that?)
- A note on two problems in connexion with graphs
- Powers of tensors and fast matrix multiplication
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Multiplying matrices faster than coppersmith-winograd
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Title not available (Why is that?)
- Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Letter to the editor: A variant on the shortest-route problem
- 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)
