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 条

[41] The minimum spanning tree problem in archaeology
Hage, P
Harary, F
James, B
AMERICAN ANTIQUITY, 1996, 61 (01) : 149 - 155
[42] STOCHASTIC BOTTLENECK SPANNING TREE PROBLEM
ISHII, H
NISHIDA, T
NETWORKS, 1983, 13 (03) : 443 - 449
[43] ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM
HASSIN, R
TAMIR, A
INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 109 - 111
[44] NOTE ON SHORTEST SPANNING TREE PROBLEM
EVANS, JR
GEOGRAPHICAL ANALYSIS, 1978, 10 (03) : 286 - 288
[45] The Distributed Minimum Spanning Tree Problem
Schmid, Stefan
Pandurangan, Gopal
Robinson, Peter
Scquizzato, Michele
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2018, (125): : 51 - 80
[46] The Minimum Moving Spanning Tree Problem
Akitaya H.A.
Biniaz A.
Bose P.
De Carufel J.-L.
Maheshwari A.
da Silveira L.F.S.X.
Smid M.
Journal of Graph Algorithms and Applications, 2023, 27 (01) : 1 - 18
[47] APPROXIMATING THE SPANNING κ-TREE FOREST PROBLEM
Liao, Chung-Shou
Zhang, Louxin
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (07) : 1543 - 1554
[48] On the Red/Blue Spanning Tree Problem
Bereg, Sergey
Jiang, Minghui
Yang, Boting
Zhu, Binhai
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 118 - +
[49] The problem of the optimal biobjective spanning tree
Ramos, RM
Alonso, S
Sicilia, J
Gonzalez, C
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 111 (03) : 617 - 628
[50] THE LONGEST EDGE OF THE RANDOM MINIMAL SPANNING TREE
Penrose, Mathew D.
ANNALS OF APPLIED PROBABILITY, 1997, 7 (02): : 340 - 361

← 1 2 3 4 5 →