Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research with important applications in network design. In this paper, we consider the degree-constrained multi-objective MST problem, which is NP-hard. On fteen benchmark instances, we compare the performance of three diierent algorithms: the Pareto archived evolution strategy (PAES); a new multiobjecti...

It is a well established result that nding the solution to the minimum spanning tree(MST) problem is an easy task if the solution to the all-pairs minimax path problem(MPP) is known. As the MST problem has a broad range of applications, a fast solution to the problem is very beneecial. Previous work has established a connectionist architecture based on the binary relation inference network whic...

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a f...

We have analyzed the cross-correlations of daily fluctuations for N = 6 358 US stock prices during the year 1999. From those N (N −1)/2 correlations coefficients, the Minimum Spanning Tree (MST) has been built. We have investigated the topology exhibited by the MST. Eventhough the average topological number is n ≈ 2, the variance σ of the topological distribution f (n) diverges! More precisely,...

We present an algorithm for computing single-source shortest paths in undirected graphs with non-negative edge weights in O( √ nm/B logn+MST(n,m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST(n,m) is the I/O-cost of computing a minimum spanning tree. Our algorithm is based on our previous algorithm for graphs with bounded edge weights. Our...