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.
2005
2005
A novel algorithm for the lossless compression of hyperspectral sounding data is presented. The algorithm rests upon an efficient… 
2005
2005
This paper considers current archaeological approaches to theorizing “tribal” society, and the contributions that stand to be… 
2003
2003
Abstract The sensory properties of fresh-cut fruit deteriorate before visual sensory properties. An appealing look that has lost… 
Review
2002
Review
2002
EndoptychumCzern. is a small genus of four species (Singer & Smith, Brittonia 10: 216–221. 1958) with a secotioid habit… 
2000
2000
O agente anticancerigeno de origem vegetal PB-100 destroi seletivamente as celulas cancerosas, mesmo quando elas sao resistentes… 
1995
1995
Leaf venation patterns are caused by the interaction of genetically determined processes, environmental effects and chance. The… 
Highly Cited
1993
Highly Cited
1993
Motivated by analysis of distributed RC delay in routing trees, a new tree construction is proposed for performance-driven global… 
Review
1983
Review
1983
ConcIusions_drawn from learning and memory retention research which are applicable to adult learning are provided in this brief…