Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q470813> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Q470813 subject Q7035728.
- Q470813 subject Q7216428.
- Q470813 subject Q8266666.
- Q470813 subject Q8266681.
- Q470813 abstract "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 subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník and later rediscovered and republished by computer scientists Robert C. Prim in 1957 and Edsger W. Dijkstra in 1959. Therefore, it is also sometimes called the DJP algorithm, Jarník's algorithm, the Prim–Jarník algorithm, or the Prim–Dijkstra algorithm.Other well-known algorithms for this problem include Kruskal's algorithm and Borůvka's algorithm. These algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, it can also be used to find the minimum spanning forest. In terms of their asymptotic time complexity, these three algorithms are equally fast for sparse graphs, but slower than other more sophisticated algorithms.However, for graphs that are sufficiently dense, Prim's algorithm can be made to run in linear time, meeting or improving the time bounds for other algorithms.".
- Q470813 thumbnail Prims_algorithm.svg?width=300.
- Q470813 wikiPageExternalLink prims-algorithm.
- Q470813 wikiPageWikiLink Q1058754.
- Q470813 wikiPageWikiLink Q1304193.
- Q470813 wikiPageWikiLink Q131476.
- Q470813 wikiPageWikiLink Q13414364.
- Q470813 wikiPageWikiLink Q1410737.
- Q470813 wikiPageWikiLink Q141488.
- Q470813 wikiPageWikiLink Q1468211.
- Q470813 wikiPageWikiLink Q166507.
- Q470813 wikiPageWikiLink Q170217.
- Q470813 wikiPageWikiLink Q186152.
- Q470813 wikiPageWikiLink Q189224.
- Q470813 wikiPageWikiLink Q21198.
- Q470813 wikiPageWikiLink Q2393193.
- Q470813 wikiPageWikiLink Q240464.
- Q470813 wikiPageWikiLink Q2422612.
- Q470813 wikiPageWikiLink Q264398.
- Q470813 wikiPageWikiLink Q269878.
- Q470813 wikiPageWikiLink Q272735.
- Q470813 wikiPageWikiLink Q274089.
- Q470813 wikiPageWikiLink Q2997928.
- Q470813 wikiPageWikiLink Q3085841.
- Q470813 wikiPageWikiLink Q504353.
- Q470813 wikiPageWikiLink Q5203305.
- Q470813 wikiPageWikiLink Q629283.
- Q470813 wikiPageWikiLink Q7003418.
- Q470813 wikiPageWikiLink Q7035728.
- Q470813 wikiPageWikiLink Q7216428.
- Q470813 wikiPageWikiLink Q727035.
- Q470813 wikiPageWikiLink Q730209.
- Q470813 wikiPageWikiLink Q797860.
- Q470813 wikiPageWikiLink Q803847.
- Q470813 wikiPageWikiLink Q82594.
- Q470813 wikiPageWikiLink Q8266666.
- Q470813 wikiPageWikiLink Q8266681.
- Q470813 wikiPageWikiLink Q8548.
- Q470813 wikiPageWikiLink Q8556.
- Q470813 wikiPageWikiLink Q92939.
- Q470813 comment "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 subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.".
- Q470813 label "Prim's algorithm".
- Q470813 depiction Prims_algorithm.svg.