Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 6,059 papers for “minimum spanning tree”

Minimum Spanning Tree.

Yann Reynaud (503432), Julie Millet (127730), David Couvin (130640) et al. · Figshare · 2015

<p>The analysis is based on sequence type for 6 VNTR markers where each circle is a graphical representation of sample size of each genotype (although not strictly proportional); the number of alleles differing between genotypes is indicated on each branch; FG, French Guiana.</p>

Cited by 0Open access

Minimum Spanning Tree

George Michailidis · Wiley StatsRef: Statistics Reference Online · 2014

Abstract A minimum spanning tree (MST) connects all the vertices of a weighted graph by existing edges whose total weight is minimum. It has been the object of intensive study due to its importance in combinatorial optimization. In this paper, we discuss the formulation of the MST problem, present some of the most commonly used algorithms for its construction, and discuss several of its applications in statistics, probability, and data analysis.

Cited by 1

Minimum spanning tree.

Erwan Lagadec (625760), Sverre Bang Småge (4567990), Christiane Trösse (11619182) et al. · Figshare · 2021

<p>Minimum spanning tree of <i>Tenacibaculum</i> strains based on 7 loci (<i>atpA</i>, <i>dnaK</i>, <i>glyA</i>, <i>gyrB</i>, <i>infB</i>, <i>rlmN</i> and <i>tgt</i>) using the goeBURST Full MLST algorithm. The sequence types (STs) are identified by a number (ST-, see <a href="https://pubmlst.org/tenacibaculum/" target="_blank">https://pubmlst.org/tenacibaculum/</a>). The circle size reflects their abundance in the data set. Group founders are indicated by a yellow circle. The analysis includes 67 new isolates for the database (66 STs from this study and ST-174 assigned to HFJ strain), and 18 STs already published. The DNA relatedness is presented with emphasis on regions (A) or hosts (B).</p>

Cited by 0Open access

Minimum spanning tree analysis.

Andreas Roetzer (281322), Roland Diel (62780), Thomas A. Kohl (281323) et al. · Figshare · 2015

<p>Minimum spanning tree allowing hypothetical nodes of the Mtb outbreak in Hamburg and Schleswig-Holstein. The year of isolation is coded by color. HH, Hanseatic City of Hamburg; SH, Schleswig-Holstein. Asterisk indicates the root of the tree determined through comparison with an outgroup (H37Rv).</p>

Cited by 0Open access

Dependency constrained minimum spanning tree

Luiz Alberto do Carmo Viana · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2016

We introduce the Dependency Constrained Minimum Spanning Tree Problem, DCMST(G,D,w), defined over a graph G(V,E) and a digraph D(E,A), whose vertices are the edges of G and whose arcs describe dependency relations between these edges. Such problem consists of finding, among the spanning trees of G(V,E) satisfying the dependency constraints imposed by D(E,A), that one whose cost is minimum, according to a edgeweight function w. The dependency constraints impose that an edge e of G can be part of a solution either if it is a source in D or if some other edge e′, such that the arc (e′, e) is in D, is part of it as well. We prove that deciding whether there is a feasible solution to DCMST(G,D,w) is an NP-complete problem, even if G is a chordal cactus and D is a union of arborescences of height at most 2. NP-completeness also applies if G is bipartite, the dependency constraints occur only between adjacent edges of G and their related arcs describe arborescences whose height is at most 2. The same results are obtained for the problem variants which demand that, instead of “some”, “exactly one”or “all”dependencies be part of a solution. To solve the problem, we introduce some integer programming formulations and some valid inequalities. We propose a strategy to reduce the problem dimension by excluding some edges of G according to the structure of D. We evaluate the introduced models and algorithms using randomly generated instances. Computational results are reported.

Cited by 0Open access

Negligence Minimum Spanning Tree Algorithm

Ayla Şaylı, Jumana H. S. Alkhalissi · European Journal of Science and Technology · 2018

In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight (cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimum spanning tree in another way. We report a comparison between our algorithm and Kruskal's MST algorithm. We implemented some examples of the graphs to get the results in less time and more effectively.

Cited by 1Open access

Bipolar Neutrosophic Minimum Spanning Tree

Said Broumi, Mohamed Talea, Assia Bakali et al. · Greater South Information System · 2018

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG). Some weights are assigned to each edge in the form of bipolar neutrosophic number (BNN). The new algorithm is described by a flow chart and a numerical example by considering some hypothetical graph. By a comparison, the advantage of proposed matrix algorithm over some existing algorithms are also discussed.

Cited by 0Open access

Stochastic Minimum Spanning Tree Games

Carmen Rodríguez Fernández, F.R. Fernández, M. J. ZAFRA · Dialnet (Universidad de la Rioja) · 2002

Stochastic cooperative games are a new area of interest within Game Theory, in which the worth given to any coalition through the characteristic function is a random variable. In this paper, we introduce a stochastic version of the minimum-cost-spanning-tree game (MCST-game). For this special class of games we give a family of core solutions that are based on proportional allocations of the worth allocated to the grand coalition. In addition, we give sufficient conditions ensuring that such allocations exist.

Cited by 0

Bipolar Neutrosophic Minimum Spanning Tree

Broumi, Said, Bakali, Assia, Talea, Mohamed et al. · Zenodo (CERN European Organization for Nuclear Research) · 2018

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG).

Cited by 0Open access

Generalized minimum spanning tree problem

Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2006

Generalized minimum spanning tree problem by Che Chan Hou thesis 2006 xi, 52 leaves : ill. ; 30 cm The Generalized Minimum Spanning Tree problem denoted by GMST is a generalized combinatorial optimization problem, spanning exactly one node from each…Read more ›

Cited by 0

Approximating the Minimum Spanning Tree

Weight In Sublinear Time · 2008

1 Introduction Traditionally, a linear time algorithm has been held as the gold standard of efficiency. In a wide variety of settings, however, large data sets have become increasingly common, and it is often desirable and sometimes necessary to find very fast algorithms which can assert nontrivial properties of the data in sublinear time.

Cited by 0

Generalized minimum spanning tree problem

Che, Chan Hou · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2006

The Generalized Minimum Spanning Tree problem denoted by GMST is a generalized combinatorial optimization problem, spanning exactly one node from each cluster in an undirected graph. GMST problems are encountered in telecom-munications network planning. In our thesis, we developed a meta-heuristic method, Tabu Search algorithm, to solve this problem. A new heuristic relaxation algorithm based on this Tabu Search to estimate the lower bound is also proposed. We compared computational results of different methods, including a mixed integer programming model, Tabu Search and Genetics Algorithm. In our computational tests on 194 TSPLIB in-stances, Tabu Search found all optimal solutions (the optimal solutions are known in 152 instances out of the 194 TSP instances). For those 42 unsolved instances, our algorithm improved some previously best known solutions. Moreover, lower bounds of some unknown problems are also improved by our heuristic relaxation algorithm.

Cited by 0

Bipolar Neutrosophic Minimum Spanning Tree

Broumi, Said, Bakali, Assia, Talea, Mohamed et al. · Figshare · 2018

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG). Some weights are assigned to each edge in the form of bipolar neutrosophic number (BNN).

Cited by 0Open access