Skip to search formSkip to main contentSkip to account menu

Prim's algorithm

Known as: Jarník algorithm, Jarník-Prim, Jarnik algorithm 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
One of the ways of learning from the data which is physically distributed over multiple locations is to have a common learning… 
2009
2009
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and single linkage… 
2009
2009
In the minimum spanning tree algorithm of graph, Prim and Kruskal algorithm are respectively applied to dense graph and sparse… 
2005
2005
This paper considers current archaeological approaches to theorizing “tribal” society, and the contributions that stand to be… 
2005
2005
Das Epithel des Darmtrak tes spielt nicht nur in der Resorption der Nahrung eine wichtige Rolle, sondern entfal tet auch eine… 
1996
1996
In this paper we present an approximate analysis of fork/join primitives with two parallel servers, limited buffers and non-zero… 
Review
1994
Review
1994
Attribute models of design objects p. 33 Formal representation of meaning in architecture p. 45 Discussion: What is a formal… 
Review
1983
Review
1983
ConcIusions_drawn from learning and memory retention research which are applicable to adult learning are provided in this brief… 
1937
1937
Einfiihrung. Die gegenw~rtig fast allgemein gebilligte Auffassung der Leuk~tmie trennt diese Blutkrankheit yon den echten…