Given a graph and a set of vertices, searching for a connected and minimum cost structure which spans the vertices is a classic problem. When no constraints are applied, the minimum cost spanning structure is a sub-graph corresponding to a tree. If all the vertices in the graph should be spanned the problem is referred to as minimum spanning tree (MST) construction and polynomial time algorithm...

We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that limn→∞ E(Ln) = ζ(3) and show that E(Ln) = ζ(3) + c1 n + c2+o(1) n4/3 where c1, c2 are explicitly defined constants.

still of wide interest, not only in the analysis of remotely sensed images. We describe a new approach to the extraction of networks of narrow curvilinear features such as road and river networks from remotely sensed MINIMUM COST PATHS images. The approach begins with the identification of points in the image with a high probability of being on the network. In the second stage the broad topolog...

We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7

This work provides a practical method for the development of rural road networks in rural areas of developing countries. The proposed methodology enables to determine obligatory points in the rural road network maximizing the number of settlements that have access to basic services within a given maximum distance. The proposed methodology is simple and practical, hence, highly applicable to rea...

Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven’t yet been explored in MT. Recently, McDonald et al. (2005b) formalized dependency parsing as a maximum spanning tree (MST) problem, which can be solved in quadratic time relative to the length of the sentence. They show that MST parsing is almo...

The "wisdom of the crowd" phenomenon refers to the finding that the aggregate of a set of proposed solutions from a group of individuals performs better than the majority of individual solutions. Most often, wisdom of the crowd effects have been investigated for problems that require single numerical estimates. We investigate whether the effect can also be observed for problems where the answer...

The size distribution of mini-filaments in voids has been derived from the Millennium Run halo catalogs at redshifts z = 0, 0.5, 1 and 2. It is assumed that the primordial tidal field originated the presence of filamentary substructures in voids and that the void filaments have evolved only little, keeping the initial memory of the primordial tidal field. Applying the filament-finding algorithm...

In this work, a new way to represent Japanese animation (anime) is presented. We applied a minimum spanning tree to show the relation between anime. The distance between anime is calculated through three similarity measurements, namely crew, score histogram, and topic similarities. Finally the centralities are also computed to reveal the most significance anime. The result shows that the minimu...