Parallel algorithm for finding the minimum edges to build a strongly connected directed graph

  • Authors:

  • Akio Tada;Eiichi Mukai;Masahiro Migita;Tsuyoshi Itokawa

  • Affiliations:

  • Sojo University, Faculty of Computer and Information Sciences, Department of Computer System Technology, Ikeda, Kumamoto City, Japan;Sojo University, Faculty of Computer and Information Sciences, Department of Computer System Technology, Ikeda, Kumamoto City, Japan;Kumamoto University, Center for Multimedia and Information Technologies, Kurokami, Kumamoto City, Japan;Kumamoto University, Graduate School of Science and Technology, Computer Science and Electrical Engineering, Kurokami, Kumamoto City, Japan

  • Venue:
  • MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of finding the minimum edges to build a strongly connected directed graph 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 propose a parallel algorithm to find the minimum edges to build a strongly connected directed graph for a disconnected directed acyclic graph in O(log(n+m)) time using O(n + m) processors on a CREW PRAM model. This algorithm is an efficient parallel algorithm because the number of processors depends on the density of the given graph and the time complexity is also more efficient when compared with the identical model.