Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Spatio-temporal detection of actions and events in video is a challenging problem. Besides the difficulties related to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Generic object detection is the challenging task of proposing windows that localize all the objects in an image, regardless of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Effective temperatures of pulsed-laser-heated soot particles were derived from their thermal emission intensities using optical… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure X
  • figure 7
Is this relevant?
Highly Cited
1999
Highly Cited
1999
[1], wheret is the averaging time in seconds. Yet, all these experi-ments were limited by technical noise rather than by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
An ontology is a set of deenitions of content-speciic knowledge representation prim-itives: classes, relations, functions, and… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Acknowledgments A Note on Translation Introduction Epic and Novel From the Prehistory of Novelistic Discourse Forms of Time and… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
We consider one origin shortest path and minimum spanning tree computations in weighted graphs. We give a lower bound on the… Expand
Is this relevant?
Highly Cited
1953
Highly Cited
1953
Input-output analysis is a method of calculating income and employment multipliers which takes account of differences in… Expand
  • figure 10.4
Is this relevant?