Author:
Kannan Vidhya,Appasamy Saraswathi,Kandasamy Ganesan
Reference12 articles.
1. Kunal Tarunkumar Shukla, Fuzzy Floyd's Algorithm To Find Shortest Route Between Nodes Under Uncertain Environment, International Journal Of Mathematics And Computer Applications Vol. 3, Issue 5, Dec 2013, 43–54.
2. Asghar Aini 1, Amir Salehipour 2, 2012, Applied Mathematics Letters, Speeding Up The Floyd– Warshall Algorithm For The Cycled Shortest Path Problem 25 Pp 1–5
3. N. Chuang, J.Y. Kung, 2005. Computers & Operations Research. The Fuzzy Shortest Path Length And The Corresponding Shortest Path In A Network, 32, Pp 1409–1428. 1
4. Y. Deng, Y. Chen, Y. Zhang, S. Mahadevan., 2012. Applied Soft Computing, Fuzzy Dijkstra Algorithm For Shortest Path Problem Under Uncertain Environment, 12 Pp 1231 – 1237. 2
5. S.T. Liu, C. Kao, 2004. IEEE Transaction On Systems. Network Flow Problems With Fuzzy Arc Lengths, Man, And Cybernetics. Part B: Cybernetics 34 Pp 765–769. 10
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献