Código QR (código de barras bidimensional)

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...

תיאור מלא

שמור ב:
Principais autores: Souhail Dhouib, Vidhya K, Said Broumi, Mohamed Talea
פורמט: Artigo
שפה:Inglês
יצא לאור: University of New Mexico 2024-06-01
סדרה:Neutrosophic Sets and Systems
נושאים:
minimum spanning tree problem
fermatean neutrosophic domain
dhouib-matrix-mstp
artificial intelligence
operations research
combinatorial optimization
גישה מקוונת:https://fs.unm.edu/NSS/SolvingMinimumSpanning2.pdf
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים