Faster Algorithms for All Pairs Non-Decreasing Paths Problem

DOI10.4230/LIPIcs.ICALP.2019.48OpenAlexW2964976529MaRDI QIDQ5091202

Ran Duan, Ce Jin, Hongxun Wu

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1904.10701

zbMATH Keywords

graph optimizationmatrix multiplicationnon-decreasing paths

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

A simple approach to nondecreasing paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs
• Quantum Algorithms for Matrix Products over Semirings
• Powers of tensors and fast matrix multiplication
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs
• Letter to the Editor—A Variant on the Shortest-Route Problem
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: Faster Algorithms for All Pairs Non-Decreasing Paths Problem