Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures-Reference-Cited by-同舟云学术

Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures

Published:2014 Issue: Volume: Page:543-554
ISSN:
Container-title:Transactions on Engineering Technologies
language:
Short-container-title:

Author:

Lončar Vladimir,Škrbić Srdjan,Balaž Antun

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-017-8832-8_39

Reference25 articles.

1. H. Ahrabian, A. Nowzari-Dalini, Parallel algorithms for minimum spanning tree problem. Int. J. Comput. Math. 79(4), 441–448 (2002)

2. D.A. Bader, G. Cong, Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J. Parallel Distrib. Comput. 66(11), 1366–1378 (2006)

3. O. Boruvka, O Jistém Problému Minimálnm (about a certain minimal problem) (in Czech, German summary). Práce Mor. Prrodoved. Spol. v Brne III, vol. 3 (1926)

4. S. Chung, A. Condon, Parallel implementation of borvka’s minimum spanning tree algorithm. in Proceedings of the 10th International Parallel Processing Symposium, IPPS ‘96 (IEEE Computer Society, Washington, DC, 1996), pp. 302–308

5. T.H. Cormen, C. Stein, R.L. Rivest, C.E. Leiserson, Introduction to Algorithms, 2nd edn. (McGraw-Hill Higher Education, Boston, 2001)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RabbitTClust: enabling fast clustering analysis of millions of bacteria genomes with MinHash sketches;Genome Biology;2023-05-17

2. Performance Study of OpenMP and Hybrid Programming Models on CPU–GPU Cluster;Emerging Research in Computing, Information, Communication and Applications;2019

3. Multi Minimum Product Spanning Tree Based Indexing Approach for Content Based Retrieval of Bio Images;Communications in Computer and Information Science;2018

4. Weighted Graphs;Texts in Computer Science;2018

5. A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem;Communications in Computer and Information Science;2017