Öz
In the life, we always aim to do anything with
the less cost considering time and distance. In graph theory, finding a minimum
weight (cost or path) is a well-known problem. A minimum spanning tree is one
of the methods brought for this purpose.
In this work, we consider a negligence algorithm to find a minimum
spanning tree in another way. We report a comparison between our algorithm and
Kruskal's MST algorithm. We implemented some examples of the graphs to get the
results in less time and more effectively.
Anahtar Kelimeler
Minimum Spanning Tree Kruskal’s Prim’s and Reverse Delete Algorithm
Kaynakça
- S. Skrbic, V. Loncar and A. Balaz. Distributed Memory Parallel Algorithms for Minimum Spanning Trees. The World Congress on Engineering, 2013.
- D. Patraa, S. Duttaa, H. Sankar, P.A. Verma, Development of GIS tool for the solution of minimum spanning tree problem using Prim’s algorithm. The International Archives of the Photogrammetry, Remote Sensing, and 143 Spatial Information Sciences, 2014, pp. 9–12.
- S. Mohanram and T. D. Sudhakar. Power System Restoration using Reverse Delete Algorithm Implemented in FPGA. Dr. M.G.R. University, Maduravoyal, Chennai, Tamil Nadu, India, 2011, pp. 373-378.
- S. I. Ramaswamy and R. Patki. Distributed Minimum Spanning Trees, 2015.
- J. Kleinberg and E. Tardos. Greedy Algorithms. In Algorithm Design; Goldstein, M.; Suarez-Rivas, M., Eds.; Pearson-Addison Wesley: London, 2005; pp. 115–209
Öz
In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight (cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimum spanning tree in another way that we called “A Negligence Minimum Spanning Tree Algorithm”. We consider a comparison between our algorithm and the classical type of the Minimum Spanning Tree Algorithm which is known as Kruskal’s algorithm because of the principle of similarity. We implemented some examples of the graphs to get the results in less time and more effectively.
Anahtar Kelimeler
Minimum Spanning Tree Kruskal’s Prim’s and Reverse Delete Algorithm
Kaynakça
- S. Skrbic, V. Loncar and A. Balaz. Distributed Memory Parallel Algorithms for Minimum Spanning Trees. The World Congress on Engineering, 2013.
- D. Patraa, S. Duttaa, H. Sankar, P.A. Verma, Development of GIS tool for the solution of minimum spanning tree problem using Prim’s algorithm. The International Archives of the Photogrammetry, Remote Sensing, and 143 Spatial Information Sciences, 2014, pp. 9–12.
- S. Mohanram and T. D. Sudhakar. Power System Restoration using Reverse Delete Algorithm Implemented in FPGA. Dr. M.G.R. University, Maduravoyal, Chennai, Tamil Nadu, India, 2011, pp. 373-378.
- S. I. Ramaswamy and R. Patki. Distributed Minimum Spanning Trees, 2015.
- J. Kleinberg and E. Tardos. Greedy Algorithms. In Algorithm Design; Goldstein, M.; Suarez-Rivas, M., Eds.; Pearson-Addison Wesley: London, 2005; pp. 115–209
Ayrıntılar
| Birincil Dil | İngilizce |
|---|---|
| Konular | Mühendislik |
| Bölüm | Makaleler |
| Yazarlar | |
| Yayımlanma Tarihi | 31 Aralık 2018 |
| Yayımlandığı Sayı | Yıl 2018 Sayı: 14 |
- Makale Dosyaları