This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1996). An incremental algorithm for a generalization of the shortest-path problem. In: Ramalingam, G. (eds) Bounded Incremental Computation. Lecture Notes in Computer Science, vol 1089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028296
Download citation
DOI: https://doi.org/10.1007/BFb0028296
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61320-6
Online ISBN: 978-3-540-68458-9
eBook Packages: Springer Book Archive