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 条

[41] A Reconfigurable Architecture for the Detection of Strongly Connected Components
Attia, Osama G.
Townsend, Kevin R.
Jones, Phillip H.
Zambreno, Joseph
ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2016, 9 (02)
[42] Computing Strongly Connected Components in the Streaming Model
Laura, Luigi
Santaroni, Federico
THEORY AND PRACTICE OF ALGORITHMS IN COMPUTER SYSTEMS, 2011, 6595 : 193 - +
[43] PARALLEL ALGORITHMS FOR CONNECTED COMPONENTS IN A GRAPH
KOUBEK, V
KRSNAKOVA, J
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 208 - 217
[44] PARALLEL ASYNCHRONOUS CONNECTED COMPONENTS IN A MESH
HAMBRUSCH, S
LUBY, M
INFORMATION PROCESSING LETTERS, 1991, 38 (05) : 257 - 263
[45] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS
HIRSCHBERG, DS
CHANDRA, AK
SARWATE, DV
COMMUNICATIONS OF THE ACM, 1979, 22 (08) : 461 - 464
[46] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A STRONGLY CONNECTED DIGRAPH
MARTELLO, S
COMPUTING, 1979, 21 (03) : 183 - 194
[47] Multi-Agent Path Finding on Strongly Connected Digraphs
Ardizzoni, S.
Saccani, I.
Consolini, L.
Locatelli, M.
2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), 2022, : 7194 - 7199
[48] Strongly Connected Components Based Efficient PPR Algorithms
Yang H.-G.
Shen D.-R.
Kou Y.
Nie T.-Z.
Yu G.
1600, Science Press (40): : 584 - 600
[49] Distributed calculation of PageRank using strongly connected components
Brinkmeier, Michael
INNOVATIVE INTERNET COMMUNITY SYSTEMS, 2006, 3908 : 29 - 40
[50] A Comparative Study of Algorithms for Computing Strongly Connected Components
Hsu, D. Frank
Lan, Xiaojie
Miller, Gabriel
Baird, David
2017 IEEE 15TH INTL CONF ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, 15TH INTL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING, 3RD INTL CONF ON BIG DATA INTELLIGENCE AND COMPUTING AND CYBER SCIENCE AND TECHNOLOGY CONGRESS(DASC/PICOM/DATACOM/CYBERSCI, 2017, : 431 - 437

← 1 2 3 4 5 →