Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,923,095 papers from all fields of science
Search
Sign In
Create Free Account
Prim's algorithm
Known as:
Jarník algorithm
, Jarník-Prim
, Jarnik algorithm
Expand
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
38 relations
Adjacency list
Adjacency matrix
Algorithm
Array data structure
Expand
Broader (1)
Spanning tree
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Devlet Destekli Bitkisel Ürün Sigortası Uygulama Sonuçları Üzerine Bir Araştırma: Ortadoğu Anadolu (TRB) Bölgesi Örneği
Mustafa Terin
,
Adem Aksoy
2015
Corpus ID: 188751776
Tarimsal uretim, dogasi geregi bircok risk ve belirsizlikle karsi karsiyadir. Bu risk ve belirsizlikler tarimsal uretimde ve…
Expand
2010
2010
An Enhanced Spanning Tree Topology for Wireless Sensor Networks
S. A. Attarde
,
Lata L. Ragha
,
Shital K. Dhamal
2010
Corpus ID: 18623581
Most of the parallel and distributed applications are subject to frequent disruptions due to resource contention and failure…
Expand
2010
2010
Intelligent Methods of Fusing the Knowledge During Incremental Learning via Clustering in A Distributed Environment
Dr. P. Nagabhushan
,
S. Zakir
,
Pradeep Kumar
2010
Corpus ID: 1849826
One of the ways of learning from the data which is physically distributed over multiple locations is to have a common learning…
Expand
2009
2009
Is VAT really single linkage in disguise?
T. Havens
,
J. Bezdek
,
J. Keller
,
M. Popescu
,
J. Huband
Annals of Mathematics and Artificial Intelligence
2009
Corpus ID: 152665
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and single linkage…
Expand
2009
2009
Research on minimum spanning tree based on prim algorithm
Zhang Li
2009
Corpus ID: 124442832
In the minimum spanning tree algorithm of graph, Prim and Kruskal algorithm are respectively applied to dense graph and sparse…
Expand
2005
2005
Marxism, Tribal Society, and the Dual Nature of Archaeology
Dean J. Saitta
2005
Corpus ID: 144513787
This paper considers current archaeological approaches to theorizing “tribal” society, and the contributions that stand to be…
Expand
1998
1998
Prime colors and color imaging
M. H. Brill
,
G. Finlayson
,
P. Hubel
,
W. A. Thornton
International Conference on Communications in…
1998
Corpus ID: 33243549
In modeling color vision, certain visible wavelengths have special significance. A growing body of scientific work shows that the…
Expand
1996
1996
On the Approximation of Higher Moments in Open and Closed Fork/Join Primitives with Limited Buffers
M. Mittler
,
Tarik Ono-Tesfaye
,
A. Schömig
1996
Corpus ID: 7820627
In this paper we present an approximate analysis of fork/join primitives with two parallel servers, limited buffers and non-zero…
Expand
1986
1986
Chiral selection and chiral induction by the use of regiospecifically di-(or poly)substituted cyclodextrins
I. Tabushi
1986
Corpus ID: 56426945
Abstract
Review
1983
Review
1983
A Review of Findings from Learning and Memory Retention Studies.
Vernon A. Magnesen
1983
Corpus ID: 141335913
ConcIusions_drawn from learning and memory retention research which are applicable to adult learning are provided in this brief…
Expand