Borůvka's algorithm
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph,or a minimum spanning forest in the case of a graph that is not connected. It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia.The algorithm was rediscovered by Choquet in 1938; again by , Łukasiewicz, , Steinhaus, and in 1951; and again by Georges Sollin in 1965. This algorithm is frequently called Sollin's algorithm, especially in the parallel computing literature.
1926 in scienceAlgorithmBoruvka's algorithmBoruvka algorithmBoruvkas algorithmBorůvka algorithmDavid KargerDistributed minimum spanning treeEuclidean minimum spanning treeExpected linear time MST algorithmGraph theoryHugo SteinhausKruskal's algorithmList of algorithmsList of graph theory topicsList of multiple discoveriesList of people from MoraviaMinimum spanning treeOtakar BorůvkaParallel algorithms for minimum spanning treesPrim's algorithmReverse-delete algorithmSollin's algorithmSollinsSollins algorithmTimeline of algorithmsVojtěch Jarník
Link from a Wikipage to another Wikipage
primaryTopic
Borůvka's algorithm
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph,or a minimum spanning forest in the case of a graph that is not connected. It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia.The algorithm was rediscovered by Choquet in 1938; again by , Łukasiewicz, , Steinhaus, and in 1951; and again by Georges Sollin in 1965. This algorithm is frequently called Sollin's algorithm, especially in the parallel computing literature.
has abstract
Algorytm Borůvki wyznacza mini ...... jest nazywany jego nazwiskiem.
@pl
Borůvka's algorithm is a greed ...... s the minimum spanning forest.
@en
Borůvkův algoritmus je algorit ...... (prosté) a kladné ohodnocení.
@cs
El Algoritmo de Borůvka es un ...... ra sobre computación paralela.
@es
L'algorithme de Borůvka, est u ...... i appelé algorithme de Sollin.
@fr
L'algoritmo di Borůvka è un al ...... atura del computing parallelo.
@it
O Algoritmo de Borůvka (ou Bar ...... ando existe apenas um vértice.
@pt
Алгори́тм Бору́вки (или алгори ...... е по параллельным вычислениям.
@ru
Алгоритм Борувки - це алгоритм пошуку мінімального кістякового дерева в графі.
@uk
ブルーフカ法とは、グラフ理論で重み付き連結グラフの最小全域木を求める最適化問題のアルゴリズムである。
@ja
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,023,120,621
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Algorytm Borůvki wyznacza mini ...... rzykład algorytmu zachłannego.
@pl
Borůvka's algorithm is a greed ...... parallel computing literature.
@en
Borůvkův algoritmus je algorit ...... (prosté) a kladné ohodnocení.
@cs
El Algoritmo de Borůvka es un ...... ra sobre computación paralela.
@es
L'algorithme de Borůvka, est u ...... i appelé algorithme de Sollin.
@fr
L'algoritmo di Borůvka è un al ...... er rendere valido l'algoritmo.
@it
O Algoritmo de Borůvka (ou Bar ...... o usa uma fila de prioridades.
@pt
Алгори́тм Бору́вки (или алгори ...... е по параллельным вычислениям.
@ru
Алгоритм Борувки - це алгоритм пошуку мінімального кістякового дерева в графі.
@uk
ブルーフカ法とは、グラフ理論で重み付き連結グラフの最小全域木を求める最適化問題のアルゴリズムである。
@ja
label
Algorithme de Borůvka
@fr
Algorithmus von Borůvka
@de
Algoritmo de Boruvka
@es
Algoritmo de Borůvka
@pt
Algoritmo di Borůvka
@it
Algorytm Borůvki
@pl
Borůvka's algorithm
@en
Borůvkův algoritmus
@cs
Алгоритм Борувки
@ru
Алгоритм Борувки
@uk