QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION
Abstract
On the classical problem of searching the shortest paths in graphs considered the possibility of accelerating the search procedure by incorporating a priori information about the search space. Global initialization of state variables predefined search and selection solutions can improve performance of multiple procedures to find paths to a linear dependence on the volume of the scanned area.
About the Authors
M. P. Revotjuk
Белорусский государственный университет информатики и радиоэлектроники
Belarus
Belarus
M. K. Qaraleh
Белорусский государственный университет информатики и радиоэлектроники
Belarus
Belarus
N. V. Khajynova
Белорусский государственный университет информатики и радиоэлектроники
Belarus
Belarus
References
1. N. Deo, Chi-yin Pang // Networks. 1984. Vol. 14. P. 275-323.
2. Fredman M.L., Tarjan R.E. //J. ACM. 1987. Vol. 34(3). P. 596-615.
3. Demetrescu C., Italiano G.F. //ACM Transactions on Algorithms. 2006. № 2 (4). P. 578-601.
4. Ревотюк М.П., Застенчик Н.И., Шешко Е.В.// Изв. БИА. 2004. № 1 (17)/2. С. 112-114.
Review
For citations:
Revotjuk M.P., Qaraleh M.K., Khajynova N.V. QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION. Doklady BGUIR. 2014;(4):73-79. (In Russ.)
Views: 3399
Email this article 