By Topic

Notes on `divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, S.K. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Deo, N.

A proof of correctness is presented for the connected-components algorithm. In addition, the authors present a modified implementation of the PARALLELFCS algorithm, which finds a fundamental cycle set of a connected graph. Analyzing the processor-(time)2 complexity, it is shown that the modified version has a better performance because it is optimally scalable to a larger number of processors

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:37 ,  Issue: 7 )