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 条

[21] Minimum spanning trees in networks with varying edge weights
Kevin R. Hutson
Douglas R. Shier
Annals of Operations Research, 2006, 146 : 3 - 18
[22] Minimum spanning trees in networks with varying edge weights
Hutson, Kevin R.
Shier, Douglas R.
ANNALS OF OPERATIONS RESEARCH, 2006, 146 (1) : 3 - 18
[23] Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Mathwieser, Corinna
Cela, Eranda
NETWORKS, 2024, 83 (03) : 587 - 604
[24] Application of neutrosophic minimum spanning tree in electrical power distribution network
Liao, Xiao Qun
Su, Tong
Ma, Li
CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY, 2020, 5 (02) : 99 - 105
[25] A Multiperiod Minimal Spanning Tree problem
Kawatra, Rakesh
Proceedings of the Sixth IASTED International Multi-Conference on Wireless and Optical Communications, 2006, : 253 - 257
[26] ON THE HISTORY OF THE MINIMUM SPANNING TREE PROBLEM
GRAHAM, RL
HELL, P
ANNALS OF THE HISTORY OF COMPUTING, 1985, 7 (01): : 43 - 57
[27] ON THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
MYUNG, YS
LEE, CH
TCHA, DW
NETWORKS, 1995, 26 (04) : 231 - 241
[28] A constrained minimum spanning tree problem
Chen, GT
Zhang, GC
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) : 867 - 875
[29] Spanning Tree Problem of Uncertain Network
Peng, Jin
Li, Shengguo
2012 2ND INTERNATIONAL CONFERENCE ON APPLIED ROBOTICS FOR THE POWER INDUSTRY (CARPI), 2012, : 659 - 663
[30] ENDIST: Edge Node Divided Spanning Tree
Suho, Changjin
Kim, Kyungmi
Shin, Jisoo
10TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS I-III: INNOVATIONS TOWARD FUTURE NETWORKS AND SERVICES, 2008, : 802 - 807

← 1 2 3 4 5 →