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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.