Results 21 to 30 of about 406 (260)
Research and Improvement of Kruskal Algorithm
It’s a very popular issue regarding the minimum cost spanning tree which is of great practical and economical significance to solve it in a concise and accelerated way. In this paper, the basic ideas of Kruskal algorithm were discussed and then presented a new improved algorithm—two branch Kruskal algorithm, which is improved to choose a middle value ...
Haiming Li, Qiyang Xia, Yong Wang
openaire +2 more sources
A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP”) and heuristic methods (musical composition method and DSATUR) to ...
Román Anselmo Mora Gutiérrez +4 more
doaj +1 more source
Intuitionistic Fuzzy Kruskal's Algorithm with Bonferroni Mean for Road Planning Problem
Noor Azzah Awang +4 more
openalex +2 more sources
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example Kruskal's algorithm.
Labouriau Rodrigo +2 more
doaj +1 more source
Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices
The minimum spanning tree (MST) problem is a fundamental problem in computer science and operations research, which has many real-life network design applications.
Zhang-Hua Fu +4 more
doaj +1 more source
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo +5 more
doaj +1 more source
Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs [PDF]
The goal of this paper is to provide linear or quasi-linear algorithms for producing some of the various trees used in mathemetical morphology, in particular the trees corresponding to hierarchies of watershed cuts and hierarchies of constrained connectivity.
Najman, Laurent +2 more
openaire +2 more sources
This study indicates that Merkel cell carcinoma (MCC) does not originate from Merkel cells, and identifies gene, protein & cellular expression of immune‐linked and neuroendocrine markers in primary and metastatic Merkel cell carcinoma (MCC) tumor samples, linked to Merkel cell polyomavirus (MCPyV) status, with enrichment of B‐cell and other immune cell
Richie Jeremian +10 more
wiley +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
Factoring a 2 x 2 contingency table.
We show that a two-component proportional representation provides the necessary framework to account for the properties of a 2 × 2 contingency table. This corresponds to the factorization of the table as a product of proportion and diagonal row or column
Stanley Luck
doaj +1 more source

