Algorithms for Searching the Shortest Path and Its Modification
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...
Saved in:
Main Authors: | N. I. Listopad, I. A. Karuk, A. A. Hayder |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Ministry of Education of the Republic of Belarus, Establishment The Main Information and Analytical Center
2016-06-01
|
Series: | Цифровая трансформация |
Online Access: | https://dt.bsuir.by/jour/article/view/17 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
by: A. A. Prihozhy, et al.
Published: (2017-11-01) -
QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
by: A. S. Nepomniaschaya
Published: (2013-04-01) -
Influence of shortest path algorithms on energy consumption of multi-core processors
by: A. A. Prihozhy, et al.
Published: (2023-10-01)