An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks
The task of finding shortest paths in graphs has been studied intensively over the past five decades. Shortest paths are one of the simplest and most widely used concepts in networks. More recently, fuzzy graphs, along with generalizations of algorithms for finding optimal paths within them, have emerged as an adequate modeling tool for imprecise systems. Fuzzy shortest paths also have a variety of applications. In this paper, the authors present a model based on dynamic programming to find the shortest paths in intuitionistic fuzzy graphs.
KeywordsIndex Matrix (IM) Intuitionistic Fuzzy Graphs (IFGs) Shortest path Dynamic programming (DP)
Unable to display preview. Download preview PDF.
- 2.Atanassov, K.: Index matrix representation of intuitionistic fuzzy graphs. In: Fifth Scientific session of the Mathematical Foundations of Artificial Intelligence Seminar, Sofia, Oct. 5 1994, pp. 36–41 (1994)Google Scholar
- 4.Atanassov, K.: Intuitionistic fuzzy Sets. Notes on Intuitionistic Fuzzy Sets 4, 59–61 (1998)Google Scholar
- 6.Bondy, J.A., Murty, U.S.: Graph Theory with Appliations. Elsevier, New York (1997)Google Scholar