SavedAdd your journal

Journals / İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi / 2017 / Cilt: 16 - Sayı: 32

The new algorithm involving Minimum Spanning Tree for computer networks in a growing company

Murat KİRİSCİ
Deniz ÖNCEL
Pages
1–14
Publication Date
2017-12-31
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

This application has reduced the cost.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The aim of this article is to present a new algorithm based on minimum spanning trees.
📊
Key Findings & Data:Minimum spanning trees have long been used in data mining, pattern recognition and machine learning.
💡
Conclusion & Impact:This application has reduced the cost.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Graph Theory · minimum spannin tree · Prim's Algorithm

Abstract

The aim of this article is to present a new algorithm based on minimum spanning trees. Minimum spanning trees have long been used in data mining, pattern recognition and machine learning. However, it is difficult to apply traditional minimum spanning tree algorithms to a large dataset since the time complexity of the algorithms is quadratic. The given algorithm is designed to reduce this difficulty. This application has reduced the cost.

Özet

The aim of this article is to present a new algorithm based on minimum spanning trees. Minimum spanning trees have long been used in data mining, pattern recognition and machine learning. However, it is difficult to apply traditional minimum spanning tree algorithms to a large dataset since the time complexity of the algorithms is quadratic. The given algorithm is designed to reduce this difficulty. This application has reduced the cost.

🔖

Cite This Article

KİRİSCİ, M., ÖNCEL, D. (2017). The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi, Cilt: 16 - Sayı: 32, 1–14. https://ajindex.com/articles/123907

📄 Full Text PDF Viewer

📄

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

References (1)

  1. Referans 1 O. BoruvkaO jistem problemu minimalnim(About a certain minimal problem), Prace mor. prirrodove d. spol. v Brne III(3), (1926), 37--58, (Czech, German summary). Referans 2 O. Boruvka,Pirispevek k reseni otazky ekonomicke stavby elekrovodnich siti (Contribution to the solution of a problem of economical construction of electirical networks)}, Elektronicky obzor, 15, (1926), 153--154. Referans 3 J. Nesetril, E. Milkova, H. Nesetrilova,Otkar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history, Dsicrete Math.,233(1-3), (2001), 3--36. Referans 4 R.C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J., 36, (1957), 567--574. Referans 5 Krishnamoorthy M., Ernst, A.T., Sharaiha, Y.M., Comparison of algorithms for the degree constrained minimum spanning tree, Journal of Heuristics, 7, (2001), 587--611. Referans 6 J.B. Kruskal, On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Amer. Math. Soc., 7, (1956), 8--50. Referans 7 http://scanftree.com/Data_Structure/prim\%27s-algorithm.