Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree

Hong Shen. Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree. Int. J. Comput. Math., 75(2):129-136, 2000. [doi]

Abstract

Abstract is missing.