spanning trees
The number of spanning trees of a graph
... The third bound only applies to regular graphs of degree r. The first three bounds are sharp for complete graphs only. The fifth bound is sharp for star or complete graph. More- over, the bound in () was also obtained by ...
13
HAMSTER: visualizing microarray experiments as a set of minimum spanning trees
... MSTs permit direct associations between samples from mixed levels of differentiation without forcing every sam- ple to be at the same level (as hierarchical clustering would). This paper describes our techniques for ...
18
Number of spanning trees of new join graphs
... corresponding adjacency matrix of the graph. However, for a few special families of graphs there exists simple formulas that make it much easier to calculate and determine the number of corresponding spanning ...
12
An Edge-Swap Heuristic for Finding Dense Spanning Trees
... Finding spanning trees under various restrictions has been an interesting question to ...a spanning tree is conveniently measured by the weight of a tree (defined as the sum of products of adjacent ...
12
An edge-based matching kernel on commute-time spanning trees
... Experimental Setup: We evaluate the performance of our new edge-based matching kernel on commute-time spanning trees (EBSK), on graph classification problems. We also com- pare our kernel with several ...
7
Estimating the weight of metric minimum spanning trees in sublinear time
... minimum spanning trees, travelling sales- man tours, and minimum Steiner trees (see, ...minimum spanning tree immediately yields sublinear-time (2 + ε )- approximation algorithms for two other ...
20
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
Indoor Positioning Using Nonparametric Belief Propagation Based on Spanning Trees
... Copyright © 2010 Vladimir Savic et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the ...
12
Finding Spanning Trees in Strongly Connected Graphs with Per-Vertex Degree Constraints
... create spanning trees on general graphs with per-vertex degree ...a spanning tree to be correct, every vertex v i in the spanning tree ...
10
Random Spanning Trees and the Prediction of Weighted Graphs
... many spanning trees, which one should be used to maxi- mize the predictive performance? This question can be answered by recalling the adversarial nature of the online setting, where the presentation of ...
34
Counting the number of spanning trees of graphs
... A spanning tree in a graph G is a tree that has the same vertex set as ...of spanning trees τ(G) in a graph has an old history and has been very active since, counting the number is interesting, and ...
11
Inadequacies of Minimum Spanning Trees in Molecular Epidemiology
... Although a classic problem of academic mathematics (10), minimum spanning trees (MSTs) have become an increasingly common tool for molecular epidemiology research. With a set of pairwise distances that ...
8
Computing the Wide Diameter of Regular Hyper Star Networks Using Independent Spanning Trees
... multiple spanning trees as broadcasting schemes and/or distribution protocols has received much ...of spanning trees of G is called independent spanning trees (ISTs for short) if ...
6
Closure for Spanning Trees with k Ended Stems
... about spanning trees with k-ended stem from the point of view of dominating ...a spanning tree with k-ended stem if and only if G has a k-ended tree that dominates G ...of spanning ...
6
Upper bounds for the number of spanning trees of graphs
... This paper is organized as follows. In Section , we give some useful lemmas. In Sec- tion , we obtain some upper bounds for the number of spanning trees of graphs in terms of the number of vertices, the ...
7
Key terms Similarity Measures, Clustering, Minimum spanning trees, Clustering purity
... A “generic” minimum spanning tree grows the tree size by adding each edge at a time [17]. There are two ways to process the generic algorithms , namely the Kruskal’s algorithm and the Prim’s algorithm. In the ...
8
Network Analysis on Safety Culture and Worker‘s Behaviour : A Forest of All Minimum Spanning Trees
... The aim of this paper is to have a better understanding to what e xtent the current pract ice of safety culture and worker‘s behaviour differs fro m DOSH policy. More specifically, to identify the most important factors ...
9
Distributed Memory Parallel Algorithms for Minimum Spanning Trees
... Abstract—Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim’s and Kruskal’s algorithm and present their ...
5
Privacy-Preserving Minimum Spanning Trees through Oblivious Parallel RAM for Secure Multiparty Computation
... An iteration of Alg. 4 can be seen as a sequence of three steps, separated by the Synchro- nize-statements. In first step, the edges to be added to the tree are selected. For each star with root r ∈ V , the lightest ...
20
A Quantum-inspired Similarity Measure for the Analysis of Complete Weighted Graphs
... We commence by setting T = 25 for the evolution of the re- quired discrete-time quantum walks. We perform kernel Prin- ciple Component Analysis (kPCA) [62] on the kernel matrix of the financial networks (from January ...
15