Finding strongly connected components in parallel

被引：0
|
作者：
Pogorilyy, S. D. [1 ]
Lozytskyi, S., I [1 ]
机构：
[1] Taras Shevchenko Natl Univ Kiev, Fac Radiphis, UA-03680 Kiev, Ukraine
来源：
APPLIED AND COMPUTATIONAL MATHEMATICS | 2007年 / 6卷 / 02期
关键词：
Tarjan's algorithm; strongly connected component; depth-first search; formal theories of algorithms; paralleling of an algorithm;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper presents the method of a parallel implementation of Tarjan's algorithm that solves an important problem of detection of strongly connected components in a directed graph. A theoretical synthesis of the corresponding scheme of the algorithm is done with the means of systems of modified algorithmic algebras developed by V.M.Glushkov (SAA-M). Theoretical estimations of the speedup of the algorithm are obtained. These estimations have been checked up and confirmed in the experiment.
引用
收藏
页码：236 / 245
页数：10
相关论文
共 50 条
  • [31] Finding 2-edge and 2-vertex strongly connected components in quadratic time
    20155101705918
    (1) University of Vienna, Vienna, Austria, 1600, ERATO Kawarabayashi Large Graph Project; MEXT Grant-in-Aid for Scientific Research on Innovative Areas: Exploring the Limits of Computation; Research Institute for Mathematical Sciences; Tateisi Science and Technology Foundation (Springer Verlag):
  • [32] Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
    Henzinger, Monika
    Krinninger, Sebastian
    Loitzenbauer, Veronika
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 713 - 724
  • [33] Finding a feasible flow in a strongly connected network
    Haeupler, Bernhard
    Tarjan, Robert E.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (04) : 397 - 398
  • [34] Decremental maintenance of strongly connected components
    Roditty, Liam
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1143 - 1150
  • [35] Finding connected components in digital images
    Khanna, V
    Gupta, P
    Hwang, CJ
    INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, PROCEEDINGS, 2001, : 652 - 656
  • [36] A NEW CLASS OF PARALLEL ALGORITHMS FOR FINDING CONNECTED COMPONENTS ON MACHINES WITH BIT-VECTOR OPERATIONS
    LIANG, Y
    DHALL, SK
    LAKSHMIVARAHAN, S
    INFORMATION SCIENCES, 1994, 76 (3-4) : 177 - 195
  • [37] Efficient decomposition of strongly connected components on GPUs
    Li, Guohui
    Zhu, Zhe
    Cong, Zhang
    Yang, Fumin
    JOURNAL OF SYSTEMS ARCHITECTURE, 2014, 60 (01) : 1 - 10
  • [38] On the Complexity of Strongly Connected Components in Directed Hypergraphs
    Xavier Allamigeon
    Algorithmica, 2014, 69 : 335 - 369
  • [39] Efficient Trimming for Strongly Connected Components Calculation
    Niewenhuis, Dante
    Varbanescu, Ana-Lucia
    PROCEEDINGS OF THE 19TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS 2022 (CF 2022), 2022, : 131 - 140
  • [40] On the Complexity of Strongly Connected Components in Directed Hypergraphs
    Allamigeon, Xavier
    ALGORITHMICA, 2014, 69 (02) : 335 - 369
12345