A dynamization of the All Pairs Least Cost Path Problem
- 18 June 2005
- book chapter
- Published by Springer Nature
- p. 279-286
- https://doi.org/10.1007/bfb0024016
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- Data structures for on-line updating of minimum spanning treesPublished by Association for Computing Machinery (ACM) ,1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- The parametric problem of shortest distancesUSSR Computational Mathematics and Mathematical Physics, 1968