Sentence examples for minimum cost spanning from inspiring English sources

Those works include a work by Orlin, who proposes algorithms to determine weakly connected components [7], strongly connected components [7], Eulerian paths [7], minimum cost spanning trees [7], maximum flows [8], and minimum cost flows [9].

The DC-CMST problem consists of finding a set of minimum cost spanning trees to link end-nodes to a source node which satisfy the traffic requirements at end-nodes and the required mean delay of a network.

The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree in a network where nodes have specified demands, with an additional capacity constraints on the subtrees incident to a given source node s.

When divisible loads originate from a single node, we compare the proposed algorithm with a recently proposed RAOLD algorithm which is based on minimum cost spanning tree [J. Yao, V. Bharadwaj, Design and performance analysis of divisible load scheduling strategies on arbitrary graphs, Cluster Computing 7(20042004) 191 207].

In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which asks for a minimum cost spanning network such that the removal of r and its incident edges breaks the network into a number of components (groups), each of which is 2-edge-connected with a total weight of at most k.

The algorithm creates and progressively merges sub-trees of a graph in building a minimum cost spanning tree.

The classical Capacitated Minimum Spanning Tree Problem (CMSTP) deals with finding a minimum-cost spanning tree so that the total demand of the vertices in each subtree does not exceed the capacity limitation.

We therefore post-process the ML trees by collapsing all nodes of common sequence (both observed haplotypes and inferred Steiner nodes) and relinking the resulting non-redundant node set into a minimum-cost spanning tree.

The generalized minimum spanning tree problem consists of designing a minimum cost tree spanning several clusters.

Given a graph whose vertex set is partitioned into clusters, the GMSTP consists of designing a minimum cost tree spanning all clusters.

We propose an optimal, two-stage procedure for the optimal design of minimum cost hierarchical spanning networks, consisting of a main path and secondary trees.