A simple approach to nondecreasing paths

DOI10.1016/J.IPL.2020.105992MaRDI QIDQ2203587zbMATH OpenOpenAlexFDO

Authors Mirosław Kowaluk, Andrzej Lingas

Publication date 7 October 2020

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ipl.2020.105992

zbMATH Keywords

graph algorithmsnondecreasing pathstime complexity

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Improved time bounds for all pairs non-decreasing paths in general digraphs
• Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
• Automata, Languages and Programming
• All pairs lightest shortest paths
• Algorithms and Data Structures

Cites work

• Efficient determination of the transitive closure of a directed graph
• Faster Algorithms for All Pairs Non-Decreasing Paths Problem
• 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
• Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
• Powers of tensors and fast matrix multiplication

Cited in

(5)

• scientific article; zbMATH DE number 3867369 (Why is no real title available?)
• Improved time bounds for all pairs non-decreasing paths in general digraphs
• Faster Algorithms for All Pairs Non-Decreasing Paths Problem
• scientific article; zbMATH DE number 5585075 (Why is no real title available?)
• Nondecreasing paths in a weighted graph or: how to optimally read a train schedule

This page was built for publication: A simple approach to nondecreasing paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203587)