Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6900458 | Procedia Computer Science | 2018 | 10 Pages |
Abstract
Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, Arindam Dey, Le Hoang Son,