The phrase "a minimal spanning tree" is correct and usable in written English.
It is typically used in the context of graph theory and computer science to refer to a subset of edges that connects all vertices in a graph with the minimum possible total edge weight.
Example: "To optimize the network design, we need to find a minimal spanning tree that connects all the nodes with the least cost."
Alternatives: "a least-cost spanning tree" or "an optimal spanning tree".
In the particular case of single linkage clustering, a minimal spanning tree is constructed that provably minimizes this sum [ 21].
In this paper we present a cycle detection based greedy algorithm, to obtain a minimal spanning tree of a given input weighted undirected graph.
Further, a novel low complexity implementation approach for the finite precision VDF using a minimal spanning tree approach is also proposed.
We have examined the hierarchical structures of correlations networks among Turkey's exports and imports by currencies for the 1996 2010 periods, using the concept of a minimal spanning tree (MST) and hierarchical tree (HT) which depend on the concept of ultrametricity.
Sánchez et al. [33] presented a minimal spanning tree (MST) algorithm to calculate the critical transmission range (CTR) that allows maintaining full network connectivity.
The surface normals are propagated using a minimal spanning tree, and then, a signed-distance function is constructed in small vicinities around the data points.
To construct TEDG, we calculate a minimal spanning tree-based on the deconvolution scores (right panel).
We then introduced a minimal spanning tree-based method to determine the final TEDG, in which we transformed the deconvoluted weights with a negative exponential function, and then calculated the minimal spanning tree with Prim's algorithm.
Different methods for clusters construction are compared, together with multi-point cluster validity index and a novel strategy based on minimal spanning tree (mst) and a analysis of the midpoints of the edges of the (mst).
A Hamiltonian cycle of all complex ensemble residues is calculated for the resulting complete adjacency graph by using an approximation to the minimal spanning tree [12].
