The shortest path (SP) problem constitutes one of the most prominent topics in graph theory
and has practical applications in many research areas such as transportation, network …

A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In
this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain …

Indeed, one of the most well-known topics in the area of graph theory is the shortest path
(SP) problem, which has practical applications in various areas of research, including …

The shortest path (SP) problem is a network optimization problem with a wide range of
applications in business and engineering. Conventional network problems assume precise …

The authors present a new algorithm for solving the shortest path problem (SPP) in a mixed
fuzzy environment. With this algorithm, the authors can solve the problems with different sets …

Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the
shortest path problems (SPP). Several researchers have worked on fuzzy shortest path …

In recent years, numerous researchers examined and analyzed several different types of
uncertainty in shortest path (SP) problems. However, those SP problems in which the costs …

Abstract The Zagreb indices (ZIs) are important graph invariants that are used extensively in
many different fields in mathematics and chemistry, such as network theory, spectral graph …

We are concerned with the design of a model and an algorithm for computing the shortest
path in a network having various types of fuzzy arc lengths. First, a new technique is devised …

Shortest path problem is one of the most fundamental components in the fields of
transportation and communication networks. This paper concentrates on a shortest path …