Highly Influenced

# Improved Parallel Algorithms for Finding the Most Vital Edge of A Graph with Respect to Minimum Spanning Tree

@inproceedings{Shen1997ImprovedPA, title={Improved Parallel Algorithms for Finding the Most Vital Edge of A Graph with Respect to Minimum Spanning Tree}, author={Hong Shen}, booktitle={PDPTA}, year={1997} }

- Published 1997 in PDPTA
DOI:10.1080/00207160008804971

Let G be a connected undirected and weighted graph with n vertices and m edges A most vital edge of G with respect to minimum spanning tree is an edge whose removal from G will cause the greatest weight increase in the minimum spanning tree of the remaining graph This paper presents fast parallel algorithms that compute the most vital edge of G in O logn time using O m log log logn logn n CRCW processors and in O logn log logn time using O m n logn log logn CREW processors respectively Thisâ€¦Â CONTINUE READING