REVIEW : — Parallel Computing Approach of the Reverse-Delete Algorithm for finding Minimum Bottleneck Spanning Tree and Minimum Spanning Trees —

The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem from the set of all feasible solutions. Many such problems require lots of processing time and power especially with problems consisting of processing big data and sometimes its impractical to do that using serial computing due to the limitation of hardware, however nowadays parallel computers with different architectures (multicore, GPUs, Clusters) are available which allows better performance and efficiency if the hardware was utilized well using parallel programming. One of the classical graph optimization problems is Minimum Spanning Trees(MST) and another related problem this paper will be addressing and considering is the Minimum Bottleneck Spanning Tree Problem (MBST).