A STUDY ON SOME NAMED GRAPHS TO FIND THE MINIMUM SPANNING TREE (MST) USING GREEDY ALGORITHMS
A Arokiamary, Battu Preethi · Journal of Physics Conference Series · 2021
Abstract In this paper, Greedy Algorithms such as Kruskal’s, Prim’s, Boruvka’s, Reverse-delete Algorithm were applied on different types of graphs like Mobius-Kantor graph, Durer graph, Golomb graph to find the (MST).