The parametric problem of shortest distances

DOI10.1016/0041-5553(68)90148-1zbMath0214.18901OpenAlexW1996548298MaRDI QIDQ5616603

V. 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

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

Related Items (5)

A survey on combinatorial optimization in dynamic environments ⋮ On the computational complexity of dynamic graph problems ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks

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