Abstract
Finding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| edges is a fundamental computational problem. The best known parallel algorithm for the CREW PRAM model runs inO(log2n) time usingn2/log2nprocessors. For the CRCW PRAM model, in which concurrent writing is permitted, the best known algorithm runs inO(logn) time using slightly more than (n+m)/lognprocessors. Simulating this algorithm on the weaker CREW model increases its running time toO(log2n). We present here a simple algorithm that runs inO(log3/2n) time usingn+mCREW processors. Finding ano(log2n) parallel connectivity algorithm for this model was an open problem for many years.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
