This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Santoro and R. Khatib: Labelling and Implicit Routing in Network. The Computer Journal, Vol. 28, No. 1, 5–8, 1985
W.D. Tajibnapis: A Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network. CACM, Vol. 20, No. 7, 477–485, 1977
J. van Leeuwen and R. B. Tan: Interval Routing, The Computer Journal, Vol. 30, No. 4, 298–307, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ružička, P. (1988). On efficiency of interval routing algorithms. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017172
Download citation
DOI: https://doi.org/10.1007/BFb0017172
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive