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 条
  • [1] Optimal algorithms for finding connected components of an unknown graph
    Shi, WP
    West, DB
    COMPUTING AND COMBINATORICS, 1995, 959 : 131 - 140
  • [2] Diagnosis of wiring networks: An optimal randomized algorithm for finding connected components of unknown graphs
    Shi, WP
    West, DB
    SIAM JOURNAL ON COMPUTING, 1999, 28 (05) : 1541 - 1551
  • [3] A robust, efficient, and balanced parallel algorithm for finding connected components
    Asokan, M.
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 2113 - 2118
  • [4] A dynamic optimal stabilizing algorithm for finding strongly connected components
    Karaata, MH
    Al-Anzi, F
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2002, 29 (02): : 259 - 275
  • [5] Finding strongly connected components in parallel
    Pogorilyy, S. D.
    Lozytskyi, S., I
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2007, 6 (02) : 236 - 245
  • [6] PARALLEL ALGORITHMS FOR CONNECTED COMPONENTS IN A GRAPH
    KOUBEK, V
    KRSNAKOVA, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 208 - 217
  • [7] Parallel algorithm for finding the minimum edges to build a strongly connected directed graph
    Tada, Akio
    Mukai, Eiichi
    Migita, Masahiro
    Itokawa, Tsuyoshi
    APPLIED MATHEMATICS FOR SCIENCE AND ENGINEERING, 2007, : 100 - +
  • [8] ON FINDING THE STRONGLY CONNECTED COMPONENTS IN A DIRECTED GRAPH
    NUUTILA, E
    SOISALONSOININEN, E
    INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 9 - 14
  • [9] Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph
    Easwarakumar, KS
    Krishnan, SV
    Rangan, CP
    Seshadri, S
    ALGORITHMICA, 1996, 15 (03) : 242 - 255
  • [10] Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph
    Algorithmica (New York), 3 (242):
12345