By Topic

Parallel Algorithm for Finding the Minimum Edges to Make a Disconnected Directed Acyclic Graph Strongly Connected

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
$33 $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

3 Author(s)
Tsuyoshi Itokawa ; Kumamoto Univ., Kumamoto ; Akio Tada ; Masahiro Migita

A problem to make a graph strongly connected is one of the most fundamental problems in graph theory. The known parallel algorithm solves this problem in O(log n) time using O(n3) processors on a CRCW PRAM model. In this paper we present a parallel algorithm to find the minimum edges to make a disconnected directed acyclic graph strongly connected in O(log(m + n)) time using O(m + n) processors on a CREW PRAM model. This algorithm is an efficient parallel algorithm because the number of processors varies according to the density of the given graph.

Published in:

Innovative Computing, Information and Control, 2007. ICICIC '07. Second International Conference on

Date of Conference:

5-7 Sept. 2007