Kruskal's algorithm (English Wikipedia)

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

refsWebsite

Global rank English rank

6doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2worldcat.org

5^th place

1archive.org

6^th place

1jstor.org

26^th place

20^th place

1tarjomefa.com

low place

1researchgate.net

120^th place

125^th place

archive.org

Cormen, Thomas; Charles E Leiserson, Ronald L Rivest, Clifford Stein (2009). Introduction To Algorithms (Third ed.). MIT Press. pp. 631. ISBN 978-0262258104.{{cite book}}: CS1 maint: multiple names: authors list (link)

doi.org

Kruskal, J. B. (1956). "On the shortest spanning subtree of a graph and the traveling salesman problem". Proceedings of the American Mathematical Society. 7 (1): 48–50. doi:10.1090/S0002-9939-1956-0078686-7. JSTOR 2033241.
Loberman, H.; Weinberger, A. (October 1957). "Formal Procedures for connecting terminals with a minimum total wire length". Journal of the ACM. 4 (4): 428–437. doi:10.1145/320893.320896. S2CID 7320964.
Quinn, Michael J.; Deo, Narsingh (1984). "Parallel graph algorithms". ACM Computing Surveys. 16 (3): 319–348. doi:10.1145/2514.2515. S2CID 6833839.
Osipov, Vitaly; Sanders, Peter; Singler, Johannes (2009). "The filter-kruskal minimum spanning tree algorithm". Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics: 52–61. doi:10.1137/1.9781611972894.5. ISBN 978-0-89871-930-7.
Katsigiannis, Anastasios; Anastopoulos, Nikos; Konstantinos, Nikas; Koziris, Nectarios (2012). "An Approach to Parallelize Kruskal's Algorithm Using Helper Threads". 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (PDF). pp. 1601–1610. doi:10.1109/IPDPSW.2012.201. ISBN 978-1-4673-0974-5. S2CID 14430930.
Lončar, Vladimir; Škrbić, Srdjan; Balaž, Antun (2014). "Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures". Transactions on Engineering Technologies. pp. 543–554. doi:10.1007/978-94-017-8832-8_39. ISBN 978-94-017-8831-1.

jstor.org

Kruskal, J. B. (1956). "On the shortest spanning subtree of a graph and the traveling salesman problem". Proceedings of the American Mathematical Society. 7 (1): 48–50. doi:10.1090/S0002-9939-1956-0078686-7. JSTOR 2033241.

researchgate.net

Lončar, Vladimir; Škrbić, Srdjan; Balaž, Antun (2014). "Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures". Transactions on Engineering Technologies. pp. 543–554. doi:10.1007/978-94-017-8832-8_39. ISBN 978-94-017-8831-1.

semanticscholar.org

api.semanticscholar.org

Loberman, H.; Weinberger, A. (October 1957). "Formal Procedures for connecting terminals with a minimum total wire length". Journal of the ACM. 4 (4): 428–437. doi:10.1145/320893.320896. S2CID 7320964.
Quinn, Michael J.; Deo, Narsingh (1984). "Parallel graph algorithms". ACM Computing Surveys. 16 (3): 319–348. doi:10.1145/2514.2515. S2CID 6833839.
Katsigiannis, Anastasios; Anastopoulos, Nikos; Konstantinos, Nikas; Koziris, Nectarios (2012). "An Approach to Parallelize Kruskal's Algorithm Using Helper Threads". 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (PDF). pp. 1601–1610. doi:10.1109/IPDPSW.2012.201. ISBN 978-1-4673-0974-5. S2CID 14430930.

tarjomefa.com

Katsigiannis, Anastasios; Anastopoulos, Nikos; Konstantinos, Nikas; Koziris, Nectarios (2012). "An Approach to Parallelize Kruskal's Algorithm Using Helper Threads". 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (PDF). pp. 1601–1610. doi:10.1109/IPDPSW.2012.201. ISBN 978-1-4673-0974-5. S2CID 14430930.

worldcat.org

Kleinberg, Jon (2006). Algorithm design. Éva Tardos. Boston: Pearson/Addison-Wesley. pp. 142–151. ISBN 0-321-29535-8. OCLC 57422612.

search.worldcat.org

Kleinberg, Jon (2006). Algorithm design. Éva Tardos. Boston: Pearson/Addison-Wesley. pp. 142–151. ISBN 0-321-29535-8. OCLC 57422612.