article · RePEc: Research Papers in Economics · 2016

Algorithms for Searching the Shortest Path and Its Modification

Н. И. Листопад, И. А. Карук, A. A. Hayder

Cited by 0Open access

Abstract

The article presents an overview of the main trends and methods of searching the shortest path information transmission in the telecommunications networks. The basic algorithms and their modifications are described. Special attention is given to the modified Dijkstra's algorithm that takes into account QoS requirements. The modified algorithm and its UML diagram are presented.

Cite this paper

APA 7

Листопад, Н. И., Карук, И. А., & Hayder, A. A. (2016). Algorithms for Searching the Shortest Path and Its Modification. RePEc: Research Papers in Economics.

MLA 9

Листопад, Н. И., et al. “Algorithms for Searching the Shortest Path and Its Modification.” RePEc: Research Papers in Economics, 2016.

Chicago

Листопад, Н. И., И. А. Карук, and A. A. Hayder. 2016. “Algorithms for Searching the Shortest Path and Its Modification.” RePEc: Research Papers in Economics.

Harvard

Листопад, Н.И., Карук, И.А. and Hayder, A.A. (2016) ‘Algorithms for Searching the Shortest Path and Its Modification’, RePEc: Research Papers in Economics.

BibTeX

@article{anon2016algorithms,
  title = {{Algorithms for Searching the Shortest Path and Its Modification}},
  author = {Листопад, Н. И. and Карук, И. А. and Hayder, A. A.},
  journal = {RePEc: Research Papers in Economics},
  year = {2016}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.