| | | |

## entrNegligence Minimum Spanning Tree AlgorithmNegligence Minimum Spanning Tree Algorithm

#### Ayla Saylı [1] , Jumana H.S. Alkhalissi [2]

##### 26 57

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.

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.

• 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
Birincil Dil en Mühendislik Makaleler Yazar: Ayla Saylı (Sorumlu Yazar)Kurum: Yildiz Technical UniversityÜlke: Turkey Yazar: Jumana H.S. AlkhalissiÜlke: Iraq
 Bibtex @araştırma makalesi { ejosat386716, journal = {Avrupa Bilim ve Teknoloji Dergisi}, issn = {}, eissn = {2148-2683}, address = {Osman Sağdıç}, year = {2018}, volume = {}, pages = {70 - 76}, doi = {10.31590/ejosat.386716}, title = {Negligence Minimum Spanning Tree Algorithm}, key = {cite}, author = {Saylı, Ayla and Alkhalissi, Jumana H.S.} } APA Saylı, A , Alkhalissi, J . (2018). Negligence Minimum Spanning Tree Algorithm. Avrupa Bilim ve Teknoloji Dergisi, (14), 70-76. DOI: 10.31590/ejosat.386716 MLA Saylı, A , Alkhalissi, J . "Negligence Minimum Spanning Tree Algorithm". Avrupa Bilim ve Teknoloji Dergisi (2018): 70-76 Chicago Saylı, A , Alkhalissi, J . "Negligence Minimum Spanning Tree Algorithm". Avrupa Bilim ve Teknoloji Dergisi (2018): 70-76 RIS TY - JOUR T1 - Negligence Minimum Spanning Tree Algorithm AU - Ayla Saylı , Jumana H.S. Alkhalissi Y1 - 2018 PY - 2018 N1 - doi: 10.31590/ejosat.386716 DO - 10.31590/ejosat.386716 T2 - Avrupa Bilim ve Teknoloji Dergisi JF - Journal JO - JOR SP - 70 EP - 76 VL - IS - 14 SN - -2148-2683 M3 - doi: 10.31590/ejosat.386716 UR - http://dx.doi.org/10.31590/ejosat.386716 Y2 - 2018 ER - EndNote %0 Avrupa Bilim ve Teknoloji Dergisi Negligence Minimum Spanning Tree Algorithm %A Ayla Saylı , Jumana H.S. Alkhalissi %T Negligence Minimum Spanning Tree Algorithm %D 2018 %J Avrupa Bilim ve Teknoloji Dergisi %P -2148-2683 %V %N 14 %R doi: 10.31590/ejosat.386716 %U 10.31590/ejosat.386716 ISNAD Saylı, Ayla , Alkhalissi, Jumana H.S. . "Negligence Minimum Spanning Tree Algorithm". Avrupa Bilim ve Teknoloji Dergisi / 14 (Aralık 2019): 70-76. http://dx.doi.org/10.31590/ejosat.386716