Spanning Tree Problem with Neutrosophic Edge Weights

被引：13

作者：

Broumi, Said ^{[1
]}

Bakali, Assia ^{[2
]}

Talea, Mohamed ^{[1
]}

Smarandache, Florentin ^{[3
]}

Dey, Arindam ^{[4
]}

Le Hoang Son ^{[5
]}

机构：

[1] Univ Hassan 2, Fac Sci Ben MSik, Lab Informat Proc, BP 7955, Casablanca, Morocco

[2] Ecole Royale Navale, Blvd Sour Jdid,BP 16303, Casablanca 16303, Morocco

[3] Univ New Mexico, Dept Math, 705 Gurley Ave, Gallup, NM 87301 USA

[4] Saroj Mohan Inst Technol, Hooghly, W Bengal, India

[5] Vietnam Natl Univ, VNU Univ Sci, Hanoi, Vietnam

来源：

PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING IN DATA SCIENCES (ICDS2017) | 2018年 / 127卷

关键词：

Single valued neutrosophic sets; neutrosophic matrix; score function; minimum spanning tree problem;

D O I：

10.1016/j.procs.2018.01.114

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 (c) 2018 The Authors. Published by Elsevier B.V.

引用

页码：190 / 199

页数：10

共 50 条

[1] Models for inverse minimum spanning tree problem with fuzzy edge weights
Zhang, Jingyu
Zhou, Jian
Zhong, Shuya
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2014, 27 (05) : 2691 - 2702
[2] A type of inverse minimum spanning tree problem with fuzzy edge weights
Zhang, Jingyu
Zhou, Jian
Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 418 - 424
[3] Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights
Zhou, Jian
Chen, Lu
Wang, Ke
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2015, 23 (01) : 49 - 71
[4] Degree-constrained minimum spanning tree problem with uncertain edge weights
Gao, Xin
Jia, Lifen
APPLIED SOFT COMPUTING, 2017, 56 : 580 - 588
[5] The Minimum Spanning Tree Problem on networks with Neutrosophic numbers
Adhikary K.
Pal P.
Poray J.
Neutrosophic Sets and Systems, 2024, 63 : 258 - 270
[6] Minimum Spanning Tree Problem with Single-Valued Trapezoidal Neutrosophic Numbers
Broumi, Said
Talea, Mohamed
Bakali, Assia
Smarandache, Florentin
Patro, Santanu Kumar
INTELLIGENT COMPUTING, VOL 2, 2019, 857 : 93 - 105
[7] EDGE EXCHANGES IN THE DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM
SAVELSBERGH, M
VOLGENANT, T
COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (04) : 341 - 348
[8] A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
Carrabs, Francesco
Gaudioso, Manlio
NETWORKS, 2021, 78 (01) : 32 - 45
[9] Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain
Dhouib S.
Vidhya K.
Broumi S.
Talea M.
Neutrosophic Sets and Systems, 2024, 67 : 11 - 20
[10] Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment
Broumi, Said
Bakali, Assia
Talea, Mohamed
Smarandache, Florentin
Ulucay, Vakkas
INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS, IBICA 2017, 2018, 735 : 25 - 35

← 1 2 3 4 5 →