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 条
  • [21] Parallel Algorithm for Finding an Eulerian Path in an Undirected Graph
    Tada, Akio
    Mukai, Eiichi
    Yoshioka, Daisaburo
    Matsumoto, Yoshimi
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2ND EDITION, 2008, : 82 - +
  • [22] Efficient parallel algorithm for finding strongly connected components based on granulation strategyEfficient parallel algorithm...T. Xu et al.
    Taihua Xu
    Huixing He
    Xibei Yang
    Jie Yang
    Jingjing Song
    Yun Cui
    Knowledge and Information Systems, 2025, 67 (3) : 2855 - 2879
  • [23] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A STRONGLY CONNECTED DIGRAPH
    MARTELLO, S
    COMPUTING, 1979, 21 (03) : 183 - 194
  • [24] FINDING THE CONNECTED COMPONENTS AND A MAXIMUM CLIQUE OF AN INTERSECTION GRAPH OF RECTANGLES IN THE PLANE
    IMAI, H
    ASANO, T
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1983, 4 (04): : 310 - 323
  • [25] A Randomized Parallel Algorithm for Planar Graph Isomorphism
    Gazit, Hillel
    Reif, John H.
    Journal of Algorithms, 1998, 28 (02): : 290 - 314
  • [26] A randomized parallel algorithm for planar graph isomorphism
    Gazit, H
    Reif, JH
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 28 (02): : 290 - 314
  • [27] SCCMulti An Improved Parallel Strongly Connected Components Algorithm
    Tomkins, Daniel
    Smith, Timmie
    Amato, Nancy M.
    Rauchwerger, Lawrence
    ACM SIGPLAN NOTICES, 2014, 49 (08) : 393 - 394
  • [28] A New Parallel Algorithm for Connected Components in Dynamic Graphs
    McColl, Robert
    Green, Oded
    Bader, David A.
    2013 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2013, : 246 - 255
  • [29] A space-efficient algorithm for finding strongly connected components
    Pearce, David J.
    INFORMATION PROCESSING LETTERS, 2016, 116 (01) : 47 - 52
  • [30] A parallel algorithm for finding all hinge vertices of an interval graph
    Honma, H
    Masuyama, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (03) : 419 - 423
12345