Araştırma Makalesi
BibTex RIS Kaynak Göster

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

Yıl 2017, Cilt: 16 Sayı: 32, 1 - 14, 31.12.2017

Murat Kirisci Deniz Öncel

Öz

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. 

Anahtar Kelimeler

Graph Theory minimum spannin tree Prim's Algorithm

Kaynakça

  • 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.

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

Yıl 2017, Cilt: 16 Sayı: 32, 1 - 14, 31.12.2017

Murat Kirisci Deniz Öncel

Öz

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. 

Anahtar Kelimeler

Graph theory minimum spanning tree Prim's algorithm

Kaynakça

  • 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.
Toplam 7 adet kaynakça vardır.

Ayrıntılar

Konular Mühendislik
Bölüm Araştırma Makaleleri
Yazarlar

Murat Kirisci

Deniz Öncel Bu kişi benim

Yayımlanma Tarihi 31 Aralık 2017
Gönderilme Tarihi 14 Eylül 2017
Yayımlandığı Sayı Yıl 2017 Cilt: 16 Sayı: 32

Kaynak Göster

APA Kirisci, M., & Öncel, D. (2017). The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi, 16(32), 1-14.
AMA Kirisci M, Öncel D. The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi. Aralık 2017;16(32):1-14.
Chicago Kirisci, Murat, ve Deniz Öncel. “The New Algorithm Involving Minimum Spanning Tree for Computer Networks in a Growing Company”. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi 16, sy. 32 (Aralık 2017): 1-14.
EndNote Kirisci M, Öncel D (01 Aralık 2017) The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi 16 32 1–14.
IEEE M. Kirisci ve D. Öncel, “The new algorithm involving Minimum Spanning Tree for computer networks in a growing company”, İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi, c. 16, sy. 32, ss. 1–14, 2017.
ISNAD Kirisci, Murat - Öncel, Deniz. “The New Algorithm Involving Minimum Spanning Tree for Computer Networks in a Growing Company”. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi 16/32 (Aralık 2017), 1-14.
JAMA Kirisci M, Öncel D. The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi. 2017;16:1–14.
MLA Kirisci, Murat ve Deniz Öncel. “The New Algorithm Involving Minimum Spanning Tree for Computer Networks in a Growing Company”. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi, c. 16, sy. 32, 2017, ss. 1-14.
Vancouver Kirisci M, Öncel D. The new algorithm involving Minimum Spanning Tree for computer networks in a growing company. İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi. 2017;16(32):1-14.
 Kapak Resmi İndir

Creative Commons Lisansı  Bu eser Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.