A simple approach to nondecreasing paths

Information Processing Letters（2020）

引用 0|浏览15

暂无评分

摘要

•A simple reduction of nondecreasing path problems to reachability problems in digraphs.•The reduction yields a simple algorithm for the single-source nondecreasing paths problem.•It yields also a simple algorithm for the all-pairs nondecreasing paths problem.

查看译文

关键词

Graph algorithms,Nondecreasing paths,Time complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要