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 条
  • [31] A parallel algorithm for finding all hinge vertices of an interval graph
    Honma, H., 2001, Institute of Electronics, Information and Communication, Engineers, IEICE (E84-D)
  • [32] A Parallel Algorithm for Finding All Elementary Circuits of a Directed Graph
    Lu, Wenbo
    Zhao, Qianchuan
    Zhou, Cangqi
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 3156 - 3161
  • [33] A PARALLEL ALGORITHM FOR FINDING A MAXIMUM WEIGHT CLIQUE OF AN INTERVAL GRAPH
    SHYU, CH
    PARALLEL COMPUTING, 1990, 13 (02) : 253 - 256
  • [34] A parallel algorithm for finding all hinge vertices of a trapezoid graph
    Honma, H
    Masuyama, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (05) : 1031 - 1040
  • [35] Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components
    Srinivasan, Sriram
    Bhowmick, Sanjukta
    Das, Sajal
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 885 - 891
  • [36] An optimal distributed algorithm for finding a set of fundamental cycles in a graph
    Chaudhuri, P
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2002, 17 (01): : 41 - 47
  • [37] A Simple Algorithm for Finding All k-Edge-Connected Components
    Wang, Tianhao
    Zhang, Yong
    Chin, Francis Y. L.
    Ting, Hing-Fung
    Tsin, Yung H.
    Poon, Sheung-Hung
    PLOS ONE, 2015, 10 (09):
  • [38] An algorithm for finding parameter-dependent connected components of gray images
    Wang, Y
    Bhattacharya, P
    IMAGE PROCESSING IMAGE QUALITY IMAGE CAPTURE SYSTEMS CONFERENCE, 1998, : 380 - 385
  • [39] Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
    Assadi, Sepehr
    Sun, Xiaorui
    Weinstein, Omri
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 461 - 470
  • [40] OPTIMAL ROUTING ALGORITHM FOR MESH-CONNECTED PARALLEL COMPUTERS
    NASSIMI, D
    SAHNI, S
    JOURNAL OF THE ACM, 1980, 27 (01) : 6 - 29
12345