Minimum spanning trees (MSTs)
Inadequacies of Minimum Spanning Trees in Molecular Epidemiology
... Minimum spanning trees (MSTs) are frequently used in molecular epidemiology research to estimate relationships among individual strains or ...
8
HAMSTER: visualizing microarray experiments as a set of minimum spanning trees
... In this paper, we have described a system called HAM- STER which allows users to visualize the experiments of a gene expression data set as a set of minimum spanning trees (MSTs). In addition, we ...
18
Estimating the weight of metric minimum spanning trees in sublinear time
... between minimum spanning trees, travelling sales- man tours, and minimum Steiner trees (see, ...the minimum spanning tree immediately yields sublinear-time (2 + ε )- ...
20
Network Analysis on Safety Culture and Worker‘s Behaviour : A Forest of All Minimum Spanning Trees
... Corre lation network approach is used to represent numerically the interre lationships among all characteristics. Once the data are collected fro m respondents, the network is then simp lified in the form of corre lation ...
9
Key terms Similarity Measures, Clustering, Minimum spanning trees, Clustering purity
... We include only one optimum edge at each step as per the procedure of Kruskal’s algorithm, it generates the minimum spanning from the weighted graph. Here MST tree and clustering results are simulated ...
8
Privacy-Preserving Minimum Spanning Trees through Oblivious Parallel RAM for Secure Multiparty Computation
... To demonstrate the usefulness of our protocols in privately implementing algorithms with private data access, and to expand the set of problems for which there exist reasonably efficient privacy-preserving protocols, we ...
20
Distributed Memory Parallel Algorithms for Minimum Spanning Trees
... Parallelization of Prim’s algorithm has been presented by Deo and Yoo [11]. Their algorithm targets shared memory computers. Improved version of Prim’s algorithm has been presented by Gonina and Kale [12]. Their ...
5
Minimum Spanning Tree with Rough Weights
... In this paper, a method has been proposed to find the minimum spanning tree of a connected graph where rough weights are attached to the edges. Considering the α- pessimistic value and α-optimistic values ...
6
A Quantum-inspired Similarity Measure for the Analysis of Complete Weighted Graphs
... commute-time minimum spanning tree from the complete weighted ...The spanning tree is probed by a discrete time quantum walk which is initialised using a weighted version of the Perron-Frobenius ...
15
Searching Minimum Spanning Tree in a Type-2 Fuzzy Graph
... Abstract. Minimum spanning tree of a connected graph has a numerous real world ...corresponding minimum spanning tree by using Bor ů vka’s ...the minimum spanning trees ...
16
Online Full Text
... Srinivasan, "A clustering algorithm for machine cell formation in group technology using minimum spanning trees," International Journal of Production Research, vol.. Onwubolu, and Muting[r] ...
6
Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
... Abstract: Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain ...all minimum spanning ...
12
An edge-based matching kernel on commute-time spanning trees
... the minimum spanning tree over the commute time matrix of a ...This spanning tree representation minimizes the number of edges of the original graph while preserving most of its structural ...
7
Cost monotonicity, consistency and minimum cost spanning tree games
... The plan of this paper is the following. In section 2, we de…ne the basic struc- ture of minimum cost spanning tree games. The main purpose of Section 3 is the construction of the new rule as well as the ...
36
Bayesian Space-Time Partitioning by Sampling and Pruning Spanning Trees
... Random spanning trees are used as a tool to tackle the problem of searching the space of possible partitions making feasible this ...the spanning trees and the partitions induced by deleting ...
35
METAHEURISTIC APPROACHES FOR THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
... edges is randomly selected from this subset and added to the tree being built. If the resulting tree appears to be very similar to some of the individuals in the popu- lation, then it is rejected. Otherwise it is ...
12
Trees with Unique Minimum Dominating Sets
... unique minimum dominating ...unique minimum domination in ...for trees with unique minimum total dominating ...on trees with unique minimum paired-dominating ...the trees ...
5
Review of a Connected Graph Using Prim's Algorithm to Find a Minimum Spanning Tree
... These two algorithms are considered as Greedy algorithm. The Kruskal’s algorithm firstly processed the edges according to their weights from lowest to largest values. It takes the lowest valued edge and added to the ...
8
Minimum Spanning Tree in Fuzzy Weighted Rough Graph
... C. In this section we describe Boruvka’s algorithm to find the minimum spanning tree(MST). It is considered as a greedy algorithm like Kruskal’s algorithm. However, unlike Kruskal’s algorithm, which merges ...
6
On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
... The minimum number of colors required of a proper-path coloring of G is called the proper connection number pc(G) of ...the minimum size of a connected spanning subgraph H of G with pc(H) = 2 is ...
15