Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem

2016 ◽  
Author(s):  
Said Broumi ◽  
Mohamed Talea ◽  
Assia Bakali ◽  
Florentin Smarandache
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Dijkstra Algorithm ◽  
Interval Valued

Research on Composite Web Services Selection Based on Dijkstra Algorithm

2014 ◽  
Vol 596 ◽  
pp. 861-867 ◽  
Author(s):  
Yu Qiang Li ◽  
Yu Wen Li ◽  
Lei Che
Keyword(s):  
Web Services ◽  
Shortest Path ◽  
Feasible Solution ◽  
Optimal Path ◽  
Shortest Path Problem ◽  
Dijkstra Algorithm ◽  
Relevant Theory ◽  
Composite Web Services

Services composing have played an important role in the industry and academia in recent years. Based on the relevant theory and experience of the shortest path problem in a DAG, we propose the method of dijkstra algorithm implementing services composing way selection. Then we provide the pseudo code description of the algorithm implementing the optimal path selecting process and test the correctness of algorithm through the contrast experiment to offer a feasible solution for services composing way selection.

Fuzzy Graphs and Fuzzy Hypergraphs

2020 ◽  
pp. 437-468
Author(s):  
Michael G. Voskoglou ◽  
Tarasankar Pramanik
Keyword(s):  
Graph Theory ◽  
Complex Networks ◽  
Shortest Path ◽  
Building Block ◽  
Shortest Path Problem ◽  
Fuzzy Graph ◽  
The Core ◽  
Fuzzy Graphs ◽  
Fuzzy Hypergraphs ◽  
Interval Valued

Relationship is the core building block of a network, and today's world advances through the complex networks. Graph theory deals with such problems more efficiently. But whenever vagueness or imprecision arises in such relationships, fuzzy graph theory helps. However, fuzzy hypergraphs are more advanced generalization of fuzzy graphs. Whenever there is a need to define multiary relationship rather than binary relationship, one can use fuzzy hypergraphs. In this chapter, interval-valued fuzzy hypergraph is discussed which is a generalization of fuzzy hypergraph. Several approaches to find shortest path between two given nodes in an interval-valued fuzzy graphs is described here. Many researchers have focused on fuzzy shortest path problem in a network due to its importance to many applications such as communications, routing, transportation, etc.

Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment

2012 ◽  
Vol 12 (3) ◽  
pp. 1231-1237 ◽  
Author(s):  
Yong Deng ◽  
Yuxin Chen ◽  
Yajuan Zhang ◽  
Sankaran Mahadevan
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Dijkstra Algorithm ◽  
Uncertain Environment

scholarly journals The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

2019 ◽  
Vol 5 (4) ◽  
pp. 391-402 ◽  
Author(s):  
Said Broumi ◽  
Deivanayagampillai Nagarajan ◽  
Assia Bakali ◽  
Mohamed Talea ◽  
Florentin Smarandache ◽  
...  
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Interval Valued
Sign in / Sign up

Export Citation Format

Share Document