A special case the of dynamization problem for least cost paths

DOI10.1016/0020-0190(91)90002-YzbMath0741.68081OpenAlexW1986349862MaRDI QIDQ1183415

Davide Crippa

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90002-y

zbMATH Keywords

dynamization problem

Mathematics Subject Classification ID

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

Cites Work

• On-line computation of transitive closures of graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A characterization of the minimum cycle mean in a digraph
• An On-Line Edge-Deletion Problem
• A new shortest path updating algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A special case the of dynamization problem for least cost paths