Kruskal's algorithm

Known as: Kruskals algorithm, Kruskal’s algorithm, Kruskal 
Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In this paper we present a Helper Threading scheme used to parallelize efficiently Kruskal's Minimum Spanning Forest algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2012
2012
In this paper, we propose a novel approach to speed-up the computation of the histograms of multiple overlapping non rotating… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The Kruskal-Wallis (KW) nonparametric analysis of variance is often used instead of a standard one-way ANOVA when data are from a… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2009
2009
We present Filter-Kruskal – a simple modification of Kruskal’s algorithm that avoids sorting edges that are “obviously” not in… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
It is the key of Krusal Algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree… (More)
Is this relevant?
2008
2008
We study the merging process when Kruskal’s algorithm is run with random graphs as inputs. Our aim is to analyze this process… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper describes an implementation of Kruskal's algorithm in query optimization process for generation of a near optimal… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Let X be a real-valued three-way array. The Candecomp/Parafac (CP) decomposition is written as X = Y(1) + · · · + Y(R) + E, where… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
CANDECOMP/PARAFAC (CP) analysis is an extension of low-rank matrix decomposition to higher-way arrays, which are also referred to… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We studied the pattern of aberrant methylation during the multistage pathogenesis of cervical cancers. We analyzed a total of 73… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?