scientific article; zbMATH DE number 30302

MaRDI QIDQ3985351zbMATH OpenFDO

Authors Chih-Chung Lin, R. C. Chang

Publication date 27 June 1992

zbMATH Keywords

dynamic shortest path problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Incremental algorithms for minimal length paths
• On-line and dynamic algorithms for shortest path problems
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Shortest paths on dynamic graphs

Cited in

(21)

• A special case the of dynamization problem for least cost paths
• On-line computation of minimal and maximal length paths
• A dynamic programming solution of a shortest path problem with time constraints on movement and parking
• NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
• On the computational complexity of dynamic graph problems
• On the directed hop-constrained shortest path problem
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
• The dynamic bowser routing problem
• Anytime search in dynamic graphs
• Speeding up dynamic shortest-path algorithms
• Dynamic shortest path algorithm based on variable weight
• Shortest path algorithm for some graphs before and after folding
• Shortest paths on dynamic graphs
• Incremental algorithms for minimal length paths
• scientific article; zbMATH DE number 1286742 (Why is no real title available?)
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Shortest-path algorithms and dynamic cost changes
• Algorithms – ESA 2004
• A block-parametric method for finding shortest paths in a graph
• Shortest paths in a diagraph with an underestimated arc weight
• Lifelong planning \(\text{A}^*\)

This page was built for publication:

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