Now a day’s many algorithms are invented / being inventing to find the solution for Euclidean Minimum Spanning Tree (EMST) problem, as its applicability is increasing in much wide range of fields containing spatial / spatio – temporal data viz. astronomy which consists of millions of spatial data. To solve this problem, we are presenting a technique by adopting the dual tree algorithm for findi...

An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the stochastic inverse minimum spanning tree problem is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tree model and a pro...

The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance co...

An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the inverse minimum spanning tree problem with stochastic edge weights is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tr...