MST — the minimum spanning tree method
Source clustering in the Hi-GAL survey determined using a minimum spanning tree method
... Methods. The minimum spanning tree (MST) method was used to identify the over-densities in two dimensions. The catalogue was further refined by folding in heliocentric distances, ...
22
An efficient method to solve least-cost minimum spanning tree (LC-MST) problem
... Introduction Minimum-cost spanning trees have many applications such as building cable networks that join n locations with minimum cost and building a road network that joins n cities with ...
5
Contractors’ minimum spanning tree
... For the next subsection where we describe this, we assume basic knowledge with matroids and matroid intersection. However, we deduce a stand alone characteriza- tion of all possible profiles, and present a stand alone ...
13
Minimum Diameter Spanning Tree
... a minimum dominating set if G has no dominating set of smaller ...of minimum dominating set of G is called the dominating number for G and it is denoted by γ ( ) G ...
6
Drawing a tree as a minimum spanning tree approximation
... Theorem 2. Let ε > 0 be a given constant. Any tree with n vertices admits a ( 1 + ε ) -EMST drawing that can be computed in O ( n ) time in the real RAM model of computation. Proof. Let T be a tree. We ...
13
Domination on Minimum Diameter Spanning Tree
... sets, minimum diameter spanning tree for grid graph and complete graph, further discuss the simple connected graphs and above which have a minimum diameter spanning tree such ...
5
Minimum Spanning Tree with Rough Weights
... a MST means to search for a subgraph G 1 = (V , E 1 ) of G, where E ! is a subset of E and the total weights attached to the edges is ...find MST which has wide application in many fields of Engineering and ...
6
A constrained minimum spanning tree problem
... the minimum spanning tree is based on the simple procedure of choosing one after the other an edge of minimum weight that has not be chosen yet and does not create cycles if added to the ...
13
The Capacitated Minimum Spanning Tree Problem
... The MST-at-change strategy performs the worst in terms of average gap and the times are greater than those of the MST-at-end strategy, which showed a good balance between time consumption and solutions ...
105
Minimum spanning tree reconstruction using autoencoders
... on minimum spanning ...an MST that follows the shape of the image because similar pixels, which usually lies on the same side of an edge, have similar grey values and the MST algorithm will ...
115
Heuristics for Minimum Spanning K-tree Problem
... spanning k-tree. Although MS2T is well studied, in literature little attention is given to the development of algorithms for solving the MSkT problem, where k > 2. The main purpose of this work is to ...
10
The diameter of the minimum spanning tree of a complete graph
... Corollary 11. Fix 1 ≤ t ≤ n − 1 and 0 < ≤ 1. Then P {|O i | ≥ (1 + )t for some 1 ≤ i ≤ t} ≤ 4e − 2 t/5 . The above crude bound on |O i | is a result of bounds on S ind and the fact that S i −S i ind ≤ i. To get ...
25
An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
... 11]. MST-ME can be used to gain physical insight into this parametric problem, by constructing a surrogate model in the full parameter space, and this is our goal in this test ...
25
Cooperative games for minimum cost spanning tree problems
... • Minimum cost spanning tree problems with priced nodes (Trudeau and Vidal-Puga, 2017) generalize Steiner tree problems in the sense that each Steiner node has assigned a price, so that ...
32
Cooperative games for minimum cost spanning tree problems
... • Minimum cost spanning tree problems with priced nodes (Trudeau and Vidal-Puga, 2017) generalize Steiner tree problems in the sense that each Steiner node has assigned a price, so that ...
32
No advantageous merging in minimum cost spanning tree problems
... The agents will be served through connections which entail some cost. However, the agents are not concerned with whether they are connected directly or indirectly to the source. Hence, the optimal network is a ...
27
Experimental study of performance of minimum spanning tree algorithms
... Prim's Algorithm with priority queue implemented using a Fibonacci heap.. Upon the conclusion of the experiment, the best results were obtained from the.[r] ...
125
SUPPLEMENT TO CHAPTER 6 MINIMUM SPANNING-TREE PROBLEMS
... The President’s top priority is to help the Russian government to re-establish communications between the seven Russian cities and Moscow at minimum cost. The price of installing communication lines between any ...
12
A Distributed Minimum Spanning Tree for Cognitive Radio Networks
... 5. Flow Chart of the Algorithm with Description 5.1 Algorithm description using flow chart We describe our proposed algorithm using flow chart to obtain a MST in CRN. We use node states and edge states in order to ...
8
Minimum Cost Spanning Tree Games and Spillover Stability
... Also, each subcoalition faces the same problem of finding a cheapest Hamiltonian circuit through the vertices in which the players in this coalition and the salesman are located. This gives rise to a cooperative cost ...
15