Application of Floyd's Algorithm in Interval Valued Neutrosophic Setting

Application of Floyd's Algorithm in Interval Valued Neutrosophic Setting

Nagarajan DeivanayagamPillai, Lathamaheswari Malayalan, Said Broumi, Florentin Smarandache, Kavikumar Jacob
Copyright: © 2020 |Pages: 30
DOI: 10.4018/978-1-7998-1313-2.ch003
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

An algorithm with complete and incremental access is called a Floyd algorithm (FA). It determines shortest path for all the pairs in the network. Though there are many algorithms have been designed for shortest path problems (SPPs), due to the completeness of Floyd's algorithm, it has been improved by considering interval valued neutrosophic numbers as the edge weights to solve neutrosophic SPP (NSPP). Further, the problem is extended to triangular and trapezoidal neutrosophic environments. Also, comparative analysis has been done with the existing method.
Chapter Preview
Top

2. Review Of Literature

(Kleeand Larman, 1979) explained the use of FA for getting shortest restricted path. (Shier, 1981) Done a study of computational method for FA. (Boulmakoul, 2004) proposed a generalized algorithm to find SP on semi rings and FSPP. (Bede, 2006) introduced operational laws of FNs and applied in Geology. (Rossi et al., 2006) proposed a prevailing structure and tractable algorithm for the fuzzy case. (Ortega et al.; 2006) examined the combination of small words and FA. (Natsheh et al., 2007) proposed Active Queue Management (AQM) method for traffic control in wireless Ad-Hoc under for fuzzy environment. (Whaley, 2008)Gave a perspective on Floyd’s paper on destruction. (Akther et al., 2009) introduced an approach for the fuzzy arithmetic operations. (Mahdavia et al., 2009) introduced programming technique to find the shortest chains for fuzzy network.

Complete Chapter List

Search this Book:
Reset