Negligence Minimum Spanning Tree Algorithm

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Avrupa Bilim ve Teknoloji Dergisi
Issue:14
Negligence Minimum Spanning Tree Algorithm

Negligence Minimum Spanning Tree Algorithm

Authors : Ayla SAYLI, Jumana Hs ALKHALİSSİ

Pages : 70-76

Doi:10.31590/ejosat.386716

View : 31 | Download : 15

Publication Date : 2018-12-31

Article Type : Research Paper

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, we consider a negligence algorithm to find a minimum spanning tree in another way that we called “A Negligence Minimum Spanning Tree Algorithm”. We co nsider 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.
Keywords : Minimum Spanning Tree, Kruskals, Prims and Reverse Delete Algorithm

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.