Browsing by Subject "Kruskal’s algorithm"

Browsing by Subject "Kruskal’s algorithm"

Sort by: Order: Results:

  • Novel approach based on the weight adjacency matrix to obtain the minimum weight spanning tree 
    Niluminda, K.P.O.; Ekanayake, E.M.U.S.B. (Faculty of Applied Science, University of Vavuniya., 2022-11-03)
    A graph’s spanning tree is created when all of its vertex connections are made without any cycles, giving rise to the term "Minimum Weight Spanning Tree (MWST)," which is the tree that has the shortest possible length ...
  • A NOVEL GRAPH THEORY TECHNIQUE TO SOLVE ASSIGNMENT PROBLEMS 
    Niluminda, K.P.O.; Ekanayake, E.M.U.S.B. (Faculty of Applied Science, University of Vavuniya, 2023-10-25)
    The Assignment Problem (AP) is a mathematical optimization problem that has to do with allocating resources to projects in the best possible way. Subject to limitations like resource availability or task requirements, the ...