Given a set of nodes N (i 1, 2, ..., n) which may represent cities and a set of requirements ria which may represent the number of telephone calls between N and N j, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning tree is a minimum among all spanning trees. The cost of communication for a pair of nodes is r;a multiplied ...

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...

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...

It is a known result that for a minimum cost spanning tree (mcst) game a Core allocation can be deduced directly from a mcst in the underlying network. To determine this Core allocation one only needs to determine a mcst in the network and it is not necessary to calculate the coalition values of the corresponding mcst game. In this paper we will deduce other Core allocations directly from the n...

Minimum cost spanning tree problems connect agents e¢ ciently to a source when agents are located at di¤erent points and the cost of using an edge is …xed. The folk and cycle-complete cost sharing solutions always o¤er core allocations. We provide similar characterizations for both. A new property is based on the following observation: when all agents have the same cost to connect to the source...

Available online 24 March 2009

We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.