Dergiler / Avrupa Bilim ve Teknoloji Dergisi / 2018 / Cilt: 0 - Sayı: 14

Negligence Minimum Spanning Tree Algorithm

Sayfa
70–76
Yayın Tarihi
2022-10-11
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

We implemented some examples of the graphs to get the results in less time and more effectively.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In the life, we always aim to do anything with the less cost considering time and distance.
📊
Temel Bulgular & Veri:In graph theory, finding a minimum weight(cost or path) is a well-known problem.
💡
Sonuç & Katkı:We implemented some examples of the graphs to get the results in less time and more effectively.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

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, weconsider a negligence algorithm to find a minimum spanning tree in another way. We report a comparison between our algorithm andKruskal's MST algorithm. We implemented some examples of the graphs to get the results in less time and more effectively.

🔖

Bu Makaleye Atıf Yap

ALKHALİSSİ, J. H., SAYLI, A. (2022). Negligence Minimum Spanning Tree Algorithm. Avrupa Bilim ve Teknoloji Dergisi, Cilt: 0 - Sayı: 14, 70–76. https://ajindex.com/articles/458315

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (2)

  1. S. Skrbic, V. Loncar and A. Balaz. Distributed Memory Parallel Algorithms for Minimum Spanning Trees. The World Congress on Engineering, 2013.
  2. 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.; PearsonAddison Wesley: London, 2005; pp. 115–209.