Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain

In classical graph theory, the minimal spanning tree (MST) is a subgraph that lacks cycles and efficiently connects every vertex by utilizing edges with the minimum weights. The computation of a minimum spanning tree for a graph has been a pervasive problem over time. However, in practical scenarios...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Souhail Dhouib, Vidhya K, Said Broumi, Mohamed Talea
Formato:	Artigo
Idioma:	Inglês
Publicado em:	University of New Mexico 2024-06-01
coleção:	Neutrosophic Sets and Systems
Assuntos:	minimum spanning tree problem fermatean neutrosophic domain dhouib-matrix-mstp artificial intelligence operations research combinatorial optimization
Acesso em linha:	https://fs.unm.edu/NSS/SolvingMinimumSpanning2.pdf
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!