A Novel Solution for Simultaneously Finding the Shortest and Possible Paths in Complex Networks
暂无分享,去创建一个
[2] Mark Taylor,et al. The evolution of geographical information systems for fire prevention support , 2014 .
[3] Chelsea C. White,et al. A heuristic search algorithm for path determination with learning , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[4] Jacob P. Kovel,et al. Using GIS in Emergency Management Operations , 2000 .
[6] Jeng-Shyang Pan,et al. Novel Systolization of Subquadratic Space Complexity Multipliers Based on Toeplitz Matrix–Vector Product Approach , 2019, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[7] Abhishek Goyal,et al. PATH FINDING: A* OR DIJKSTRA’S? , 2014 .
[8] Mariusz Dramski. Bi-directional search in route planning in navigation , 2014 .
[9] Yi-Zhan Huang,et al. An Improved Dijkstra Shortest Path Algorithm , 2013 .
[10] Dorothea Wagner,et al. Partitioning graphs to speedup Dijkstra's algorithm , 2007, ACM J. Exp. Algorithmics.
[11] Ehrenfried Lepuschitz,et al. Geographic information systems in mountain risk and disaster management , 2015 .
[12] Guifeng Zheng,et al. HAS: Hierarchical A-Star Algorithm for Big Map Navigation in Special Areas , 2014, 2014 5th International Conference on Digital Home.
[13] Ian H. Witten,et al. Data mining: practical machine learning tools and techniques, 3rd Edition , 1999 .
[14] Karbhari V. Kale,et al. Network Analysis for Finding Shortest Path in Hospital Information System , 2015 .
[15] Ismaïl Chabini,et al. Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks , 2002, IEEE Trans. Intell. Transp. Syst..
[16] Erna Budhiarti Nababan,et al. Nearby Search Indekos Based Android Using A Star (A*) Algorithm , 2018 .
[17] WagnerDorothea,et al. Partitioning graphs to speedup Dijkstra's algorithm , 2007 .
[18] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.
[19] Xiang Liu,et al. A comparative study of A-star algorithms for search and rescue in perfect maze , 2011, 2011 International Conference on Electric Information and Control Engineering.
[20] Milena Karova,et al. Comparative analysis of algorithms to search for the shortest path in a maze , 2016, 2016 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom).
[21] Muhammad Aasim Qureshi,et al. A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs , 2009, ArXiv.
[22] Hesham A. Rakha,et al. Estimating Path Travel-Time Reliability , 2006, 2006 IEEE Intelligent Transportation Systems Conference.
[23] Andrew V. Goldberg,et al. Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.
[24] Alexander Setiawan,et al. Performance Analysis of Dijkstra, A* and Ant Algorithm for Finding Optimal Path Case Study : Surabaya City Map , 2010 .
[25] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.