Author(s)
Parth Solanki, Rushirajsinh Gohil, Jenil Patel, Prof. Ekta Unagar, Prof. Dhaval R. Chandaraba
- Manuscript ID: 140035
- Volume: 2
- Issue: 2
- Pages: 124–142
Subject Area: Computer Science
Abstract
The minimum spanning tree (MST) Problem is an excellent way to show how Graph Theory and Network Optimization relate to each other, as well as how many of the classic algorithms are still in play today. As pointed out by Pettie & Ramachandran (2003), the History of the MST Problem and its Optimality has been expanded upon through their work and since then many researchers have focused on creating more Data and other types of Data to explore the original question of whether the MST is indeed Optimal and provides a theoretical path for further Research/Field Advancements, as well as to provide Data Types, Data Representation and eventually the Bioinformatic approach using MST Modelings. Many Articles, etc from 2010, 2020 and 2024 are more references of, and had provided ways to inform larger Data, Data Types and Data Representations. In addition, there are more references to larger Data, Data Type representations using visualized representation with Bioinformatic methods within the Literature. This paper will provide an overview of the Literature developments, complications and Performance of MST and the Algorithm(s) with a focus on Scalability, Adaptivity (to larger), AI and materials of a larger scale.