EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms

Badri Munier, Muhammad Aleem, Muhammad Arshad Islam, Muhammad Azhar Iqbal, Waqar Mehmood

Sukkur IBA Journal of Computing and Mathematical Sciences · 2017

DOI: 10.30537/sjcms.v1i1.8 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sukkur IBA Journal of Computing and Mathematical Sciences, 2017. Verfasst von Badri Munier und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the computing power of multi-core machines. Computer network routing, civil infrastructure planning and cluster analysis are typically use-cases of spanning tree problem. The experimental results show that the proposed algorithm is scalable for different machine and graph sizes. The methodology is simple and can easily be implemented using different shared-memory parallel programming models.

Zitieren

APA

Munier, B., Aleem, M., Islam, M. A., Iqbal, M. A., & Mehmood, W. (2017). A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms. Sukkur IBA Journal of Computing and Mathematical Sciences. https://doi.org/10.30537/sjcms.v1i1.8

Vancouver

Munier B, Aleem M, Islam MA, Iqbal MA, Mehmood W. A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms. Sukkur IBA Journal of Computing and Mathematical Sciences. 2017. doi:10.30537/sjcms.v1i1.8

BibTeX
@article{Munier2017,
  author = {Munier, Badri and Aleem, Muhammad and Islam, Muhammad Arshad and Iqbal, Muhammad Azhar and Mehmood, Waqar},
  title = {A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms},
  journal = {Sukkur IBA Journal of Computing and Mathematical Sciences},
  year = {2017},
  doi = {10.30537/sjcms.v1i1.8}
}
Kostenlos starten →