Processor efficient parallel graph algorithms
Published in University of Southern California Digital Library • Jan 1, 2015
NobleIDNI9P00W17R47S05
Authors:
Hillel Gazit
Abstract
Several parallel algorithms are presented. The following results were achieved: (1) An optimal randomized parallel algorithm for finding connected components in undirected graphs. The algorithm takes O(log(n)) time. (2) A parallel BFS algorithm for directed graphs that improves the number of process...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!