An Algorithm for Estimation of Current Traffic for shortest path in Real Time
Abstract
Full Text:
PDFReferences
Karger DR, Koller D, Phillips SJ. Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J Comput. 1993; 22: 1199–1217p.
Naphade P, Dongre Y. Shortest path estimation for graph data using a relational technique. Int J Database Manag Syst (IJDMS). 2015; 7(4).
Zhan FB. Three fastest shortest path algorithms on real road networks: data structure and procedures. J Gender Inform Dev Afr (JGIDA). 1997; 1(1): 70–82p.
Zeng W, Church RL. Finding shortest paths on real road networks: the case for A*. Int J Geogr Infor Sci (IJGIS). 2009; 23(4): 531–543p.
Magzhan K, Jani HM. A review and evaluations of shortest path algorithms, Int J Sci Technol Res (IJSTR). 2013; 2(6): ISSN 2277-8616.
Kiruthikam R, Umaranim R. Shortest path algorithms: a comparative analysis. Int J Manag Educ. 2012; 2(4): ISSN: 2249-0558.
Chandel GS, Gupta R, Kushwaha A. Implementation of shortest path in packet switching network using genetic algorithm. Int J Adv Res Comput Sci Softw Engg. 2012; 2(2): ISSN: 2277 128X.
Pettie S, Ramachandran V. A shortest path algorithm for real-weighted undirected graphs. SIAM J Comput. 2005; 34(6): 1398–1431p.
DOI: https://doi.org/10.37628/jpnc.v4i1.639
Refbacks
- There are currently no refbacks.