AN OPTIMAL RANDOMIZED PARALLEL ALGORITHM FOR FINDING CONNECTED COMPONENTS IN A GRAPH

被引：46
|
作者：
GAZIT, H
机构：
[1] Duke Univ, Durham, NC
来源：
SIAM JOURNAL ON COMPUTING | 1991年 / 20卷 / 06期
关键词：
CONNECTED COMPONENTS; RANDOMIZED ALGORITHM; PARALLEL COMPUTING; CRCW; UNDIRECTED GRAPH;
D O I：
10.1137/0220066
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A parallel randomized algorithm for finding the connected components of an undirected graph is presented. The algorithm has an expected running time of T = O(log(n)) with P = O((m + n)/log(n)) processors, where m is the number of edges and n is the number of vertices. The algorithm is optimal in the sense that the product P . T is a linear function of the input size. The algorithm requires O(m + n) space, which is the input size, so it is optimal in space as well.
引用
收藏
页码：1046 / 1067
页数：22
相关论文
共 50 条
  • [41] OPTIMAL ROUTING ALGORITHM FOR MESH-CONNECTED PARALLEL COMPUTERS
    NASSIMI, D
    SAHNI, S
    JOURNAL OF THE ACM, 1980, 27 (01) : 6 - 29
  • [42] FINDING A MINIMAL COVER FOR BINARY IMAGES - AN OPTIMAL PARALLEL ALGORITHM
    MOITRA, D
    ALGORITHMICA, 1991, 6 (05) : 624 - 657
  • [43] A GPU parallel algorithm for finding a negative subset disjoint cycle in a graph
    Sielski, Piotr
    Corduk, Akif
    Linsenmaier, Hugo
    Fender, Alex
    2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
  • [44] An optimal distributed algorithm for computing bridge-connected components
    Chaudhuri, P
    COMPUTER JOURNAL, 1997, 40 (04): : 200 - 207
  • [45] A distributed self-stabilizing algorithm for finding a connected dominating set in a graph
    Jain, A
    Gupta, A
    PDCAT 2005: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Proceedings, 2005, : 615 - 619
  • [46] A FULLY-PIPELINED SYSTOLIC ALGORITHM FOR FINDING BRIDGES ON AN UNDIRECTED CONNECTED GRAPH
    HSU, SC
    HSIEH, HF
    HUANG, ST
    PARALLEL COMPUTING, 1992, 18 (04) : 377 - 391
  • [47] A coarse-grained parallel algorithm for spanning tree and connected components
    Cáceres, EN
    Dehne, F
    Mongelli, H
    Song, SW
    Szwarcfiter, JL
    EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 828 - 831
  • [48] PARALLEL ALGORITHM FOR FINDING MINIMUM EDGES REQUIRED TO MAKE A DAG STRONGLY CONNECTED
    Itokawa, Tsuyoshi
    Tada, Akio
    Migita, Masahiro
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (03): : 581 - 588
  • [49] LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory
    Azad, Ariful
    Buluc, Aydin
    2019 IEEE 33RD INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2019), 2019, : 2 - 12
  • [50] A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
    Cabello, Sergio
    Saumell, Maria
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (01): : 1 - 12
12345