The parametric problem of shortest distances

DOI10.1016/0041-5553(68)90148-1MaRDI QIDQ5616603zbMATH OpenOpenAlexFDO

Authors V. Rodionov

Publication date 1971

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(68)90148-1

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35)

Cited in

(5)

• On the computational complexity of dynamic graph problems
• Fully dynamic all pairs shortest paths with real edge weights
• Algorithmic techniques for maintaining shortest routes in dynamic networks
• A survey on combinatorial optimization in dynamic environments
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures

This page was built for publication: The parametric problem of shortest distances

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