Abstract
The problem of finding a smallest set of edges whose addition biconnects an undirected graph is considered. An error in the earlier linear time sequential algorithm of Rosenthal & Goldner [19] is corrected and a new O(log2 n) time parallel algorithm using a linear number of processors on an EREW PRAM is given, where n is the number of vertices in the input graph. The time bound is the best that is known for graph problems on an EREW PRAM, and the processor bound is close to the best possible.KeywordsParallel AlgorithmUndirected GraphInput GraphBlock TreeLinear NumberThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
