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

Author

Itokawa, Tsuyoshi ; Tada, Akio ; Migita, Masahiro

Author_Institution

Kumamoto Univ., Kumamoto

fYear

2007

fDate

5-7 Sept. 2007

Firstpage

131

Lastpage

131

Abstract

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(n³) 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.

Keywords

computational complexity; directed graphs; microprocessor chips; parallel algorithms; random-access storage; CRCW PRAM model; CREW PRAM model; O(log n) time; O(n³) processors; directed acyclic graph; graph theory; parallel algorithm; Broadcasting; Computational modeling; Computer science; Concurrent computing; Graph theory; Information technology; Multimedia systems; Parallel algorithms; Phase change random access memory; Writing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Kumamoto

Print_ISBN

0-7695-2882-1

Type

conf

DOI

10.1109/ICICIC.2007.437

Filename

4427776