References

Arman, N., 2005. An efficient algorithm for checking path existence between graph vertices. Proceedings of the 6th International Arab Conference on Information Technology, December 6-8, 2005, Amman, Jordan, pp: 471-476.

Arman, N., 2005. Graph representation comparative study. Proceedings of the International Conference on Foundations of Computer Science, June 27-30, 2005, Las Vegas, USA., pp: 1-5.

Arman, N., 2005. Graph representation: Comparative study and performance evaluation. Inform. Technol. J., 4: 465-468.
CrossRef  |  Direct Link  |  

Cormen, T.H., C.E. Leiserson, R.L. Rivest and C. Stein, 2001. Introduction to Algorithms. 2nd Edn., MIT Press, Cambridge, MA., USA., ISBN-13: 978-0262032933, pp: 595-601.

Dijkstra, E.W., 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269-271.
CrossRef  |  Direct Link  |  

Khamayseh, F. and N. Arman, 2014. An efficient heuristic shortest path algorithm using candidate subgraphs. Proceedings of the International Conference on Intelligent Systems and Applications, March 22-24, 2014, Hammamet, Tunisia, pp: 1-5.

Khamayseh, F. and N. Arman, 2014. Using candidate subgraphs to improve single-source single-destination shortest path algorithms. SYLWAN J., 158: 303-312.

Khamayseh, F., A.S.E. Ahmed and L.M. El-Fangary, 2009. Evaluation of learner achievement within Active Multimodal Presentation (AMP) and static e-learning modes. Egypt. Comput. Sci. J., Vol. 31, No. 3.

Kumar, A. and M. Kaur, 2011. A new algorithm for solving shortest path problem on a network with imprecise edge weight. Applic. Applied Math., 6: 602-619.
Direct Link  |  

Orlin, J.B., K. Madduri, K. Subramani and M. Williamson, 2010. A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms, 8: 189-198.
CrossRef  |  

Shibuya, T., 1999. Computing the n X m Shortest Paths Efficiently. In: Algorithm Engineering and Experimentation, Goodrich, M.T. and C.C. McGeoch (Eds.). Springer Science and Business Media, New York, pp: 210-225.

Xiao, L., L. Chen and J. Xiao, 2012. A new algorithm for shortest path problem in large-scale graph. Applied Math., 6: 657-663.
Direct Link  |