An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.