Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs
This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. We analyze the effectiveness of Prim's method for construct...
Saved in:
| Main Authors: | Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2025-06-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/21MinimumSpanning.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
MODIFIED WEIGHT MATRIX USING PRIM’S ALGORITHM IN MINIMUM SPANNING TREE (MST) APROACH FOR GSTAR(1;1) MODEL
by: Nur'ainul Miftahul Huda, et al.
Published: (2023-04-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
Performance of a simple ACO on the minimum label spanning tree problem
by: Xinsheng Lai, et al.
Published: (2025-04-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
FedWT: Federated Learning with Minimum Spanning Tree-based Weighted Tree Aggregation for UAV networks
by: Geonhui Kim, et al.
Published: (2025-04-01)