Borůvka's algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Borůvka's algorithm" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

3psu.edu

207^th place

136^th place

3semanticscholar.org

11^th place

8^th place

2ams.org

451^st place

277^th place

1dml.cz

low place

1handle.net

102^nd place

76^th place

1eudml.org

low place

1emis.de

low place

1princeton.edu

741^st place

577^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena (2001). "Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history". Discrete Mathematics. 233 (1–3): 3–36. doi:10.1016/S0012-365X(00)00224-7. hdl:10338.dmlcz/500413. MR 1825599.
Florek, K.; Łukaszewicz, J.; Perkal, J.; Steinhaus, Hugo; Zubrzycki, S. (1951). "Sur la liaison et la division des points d'un ensemble fini". Colloquium Mathematicum (in French). 2 (3–4): 282–285. doi:10.4064/cm-2-3-4-282-285. MR 0048832.

dml.cz (Global: low place; English: low place)

Borůvka, Otakar (1926). "O jistém problému minimálním" [About a certain minimal problem]. Práce Mor. Přírodověd. Spol. V Brně III (in Czech and German). 3: 37–58.

doi.org (Global: 2^nd place; English: 2^nd place)

Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena (2001). "Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history". Discrete Mathematics. 233 (1–3): 3–36. doi:10.1016/S0012-365X(00)00224-7. hdl:10338.dmlcz/500413. MR 1825599.
Florek, K.; Łukaszewicz, J.; Perkal, J.; Steinhaus, Hugo; Zubrzycki, S. (1951). "Sur la liaison et la division des points d'un ensemble fini". Colloquium Mathematicum (in French). 2 (3–4): 282–285. doi:10.4064/cm-2-3-4-282-285. MR 0048832.
Bader, David A.; Cong, Guojing (2006). "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs". Journal of Parallel and Distributed Computing. 66 (11): 1366–1378. CiteSeerX 10.1.1.129.8991. doi:10.1016/j.jpdc.2006.06.001. S2CID 2004627.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995). "A randomized linear-time algorithm to find minimum spanning trees". Journal of the ACM. 42 (2): 321–328. CiteSeerX 10.1.1.39.9012. doi:10.1145/201019.201022. S2CID 832583.
Chazelle, Bernard (2000). "A minimum spanning tree algorithm with inverse-Ackermann type complexity" (PDF). J. ACM. 47 (6): 1028–1047. CiteSeerX 10.1.1.115.2318. doi:10.1145/355541.355562. S2CID 6276962.

emis.de (Global: low place; English: low place)

Eppstein, David (1999). "Spanning trees and spanners". In Sack, J.-R.; Urrutia, J. (eds.). Handbook of Computational Geometry. Elsevier. pp. 425–461.; Mareš, Martin (2004). "Two linear time algorithms for MST on minor closed graph classes" (PDF). Archivum Mathematicum. 40 (3): 315–320..

eudml.org (Global: low place; English: low place)

Florek, K.; Łukaszewicz, J.; Perkal, J.; Steinhaus, Hugo; Zubrzycki, S. (1951). "Sur la liaison et la division des points d'un ensemble fini". Colloquium Mathematicum (in French). 2 (3–4): 282–285. doi:10.4064/cm-2-3-4-282-285. MR 0048832.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena (2001). "Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history". Discrete Mathematics. 233 (1–3): 3–36. doi:10.1016/S0012-365X(00)00224-7. hdl:10338.dmlcz/500413. MR 1825599.

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

Chazelle, Bernard (2000). "A minimum spanning tree algorithm with inverse-Ackermann type complexity" (PDF). J. ACM. 47 (6): 1028–1047. CiteSeerX 10.1.1.115.2318. doi:10.1145/355541.355562. S2CID 6276962.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Bader, David A.; Cong, Guojing (2006). "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs". Journal of Parallel and Distributed Computing. 66 (11): 1366–1378. CiteSeerX 10.1.1.129.8991. doi:10.1016/j.jpdc.2006.06.001. S2CID 2004627.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995). "A randomized linear-time algorithm to find minimum spanning trees". Journal of the ACM. 42 (2): 321–328. CiteSeerX 10.1.1.39.9012. doi:10.1145/201019.201022. S2CID 832583.
Chazelle, Bernard (2000). "A minimum spanning tree algorithm with inverse-Ackermann type complexity" (PDF). J. ACM. 47 (6): 1028–1047. CiteSeerX 10.1.1.115.2318. doi:10.1145/355541.355562. S2CID 6276962.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Bader, David A.; Cong, Guojing (2006). "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs". Journal of Parallel and Distributed Computing. 66 (11): 1366–1378. CiteSeerX 10.1.1.129.8991. doi:10.1016/j.jpdc.2006.06.001. S2CID 2004627.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995). "A randomized linear-time algorithm to find minimum spanning trees". Journal of the ACM. 42 (2): 321–328. CiteSeerX 10.1.1.39.9012. doi:10.1145/201019.201022. S2CID 832583.
Chazelle, Bernard (2000). "A minimum spanning tree algorithm with inverse-Ackermann type complexity" (PDF). J. ACM. 47 (6): 1028–1047. CiteSeerX 10.1.1.115.2318. doi:10.1145/355541.355562. S2CID 6276962.

Borůvka's algorithm (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

dml.cz (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

emis.de (Global: low place; English: low place)

eudml.org (Global: low place; English: low place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

princeton.edu (Global: 741st place; English: 577th place)

cs.princeton.edu

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

ams.org (Global: 451^st place; English: 277^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

handle.net (Global: 102^nd place; English: 76^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)