Código QR

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 constructing the mi...

Descrición completa

Gardado en:
Detalles Bibliográficos
Principais autores: Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut
Formato: Artigo
Idioma:Inglês
Publicado: University of New Mexico 2025-06-01
Series:Neutrosophic Sets and Systems
Assuntos:
Acceso en liña:https://fs.unm.edu/NSS/21MinimumSpanning.pdf
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!