FINDING ALL MINIMUM-HOP PATHS IN NETWORKS

Authors

  • Iskra K. Džonova-Popova Author
  • Oliver B. Popov Author

Abstract

The problem of finding all minimum-hop paths from one node to another arises in several contexts for adaptive routing in computer communication networks. This paper presents an efficient algorithm for determining all paths with minimum number of links between two nodes in a network. Polynomial bound are established for the worst case time complexity of the algorithm. Directions for further research are also proposed.

Downloads

Download data is not yet available.

Downloads

Published

1992-01-01

Issue

Vol. 16 (1992): 16 (XLII) (1992)

Section

Articles

License

Copyright (c) 1992 Matematichki Bilten

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
I. K. Džonova-Popova and O. B. Popov, “FINDING ALL MINIMUM-HOP PATHS IN NETWORKS”, Mat. Bilt., vol. 16, no. 1, pp. 99–104, Jan. 1992, Accessed: Aug. 14, 2026. [Online]. Available: https://bilten.smm.org.mk/index.php/bilten/article/view/1497