Shoaib Khan | Bahria University, Islamabad-Pakistan (original) (raw)
Uploads
Papers by Shoaib Khan
The minimum spanning tree is the one in which a graph is composed of E edges and V vertices belon... more The minimum spanning tree is the one in which a graph is composed of E edges and V vertices belongs to G [V, E]. In this paper a well-known problem of minimum tree. Many algorithms have been designed for reducing the cost of tree and make it asymptotically efficient. Those algorithms proposed the ideas to removing the cycles from the graphs to compose a tree. For that a comparison has been taken place among algorithms to check whether which technology and their equivalent algorithms work most effectively along with the time complexity of respective algorithms. Four efficient algorithms have been explained in detail in this paper to address MST problem more effectively along with the examples.
The minimum spanning tree is the one in which a graph is composed of E edges and V vertices belon... more The minimum spanning tree is the one in which a graph is composed of E edges and V vertices belongs to G [V, E]. In this paper a well-known problem of minimum tree. Many algorithms have been designed for reducing the cost of tree and make it asymptotically efficient. Those algorithms proposed the ideas to removing the cycles from the graphs to compose a tree. For that a comparison has been taken place among algorithms to check whether which technology and their equivalent algorithms work most effectively along with the time complexity of respective algorithms. Four efficient algorithms have been explained in detail in this paper to address MST problem more effectively along with the examples.