| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 485582 | Procedia Computer Science | 2015 | 7 Pages |
Abstract
The shortest path problem is a classical network optimization problem which has a wide range of applications in various fields of science and engineering. In the present communication, an algorithm to find the shortest path and shortest distance in an interval-valued intuitionistic fuzzy graph with nodes and links being crisp but the edge weights will be Interval-valued Intuitionistic Trapezoidal Fuzzy Numbers (IITFNs). Finally, a numerical example has been provided for illustrating the proposed approach.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
