AN IMPROVED ALGORITHM FOR TRANSITIVE CLOSURE ON ACYCLIC DIGRAPHS

被引：60

|

作者：

SIMON, K

机构：

[1] Univ des Saarlandes, Germany

来源：

THEORETICAL COMPUTER SCIENCE | 1988年 / 58卷 / 1-3期

关键词：

D O I：

10.1016/0304-3975(88)90032-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

9

引用

收藏

页码：325 / 346

页数：22

相关论文

共 50 条

[1] AN IMPROVED ALGORITHM FOR TRANSITIVE CLOSURE ON ACYCLIC DIGRAPHS
SIMON, K
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 376 - 386
[2] AN EFFICIENT TRANSITIVE CLOSURE ALGORITHM FOR CYCLIC DIGRAPHS
NUUTILA, E
INFORMATION PROCESSING LETTERS, 1994, 52 (04) : 207 - 213
[3] AN IMPROVED TRANSITIVE CLOSURE ALGORITHM
SCHMITZ, L
COMPUTING, 1983, 30 (04) : 359 - 371
[4] Computing transitive closure of bipolar weighted digraphs
Niesink, Patrick
Poulin, Keven
Sajna, Mateja
DISCRETE APPLIED MATHEMATICS, 2013, 161 (1-2) : 217 - 243
[5] Efficient parallel implementation of transitive closure of digraphs
Alves, CER
Cáceres, EN
Castro, AA
Song, SW
Szwarcfiter, JL
RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 2003, 2840 : 126 - 133
[6] Efficient parallel implementation of transitive closure of digraphs
Alves, C.E.R.
Cáceres, E.N.
Castro Jr., A.A.
Song, S.W.
Szwarcfiter, J.L.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2840 : 126 - 133
[7] AN ALGORITHM FOR TRANSITIVE REDUCTION OF AN ACYCLIC GRAPH
GRIES, D
MARTIN, AJ
VANDESNEPSCHEUT, JLA
UDDING, JT
SCIENCE OF COMPUTER PROGRAMMING, 1989, 12 (02) : 151 - 155
[8] Decremental Transitive Closure and Shortest Paths for Planar Digraphs and Beyond
Karczmarz, Adam
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 73 - 92
[9] ON FLETCHER TRANSITIVE CLOSURE ALGORITHM
LEHMANN, D
COMMUNICATIONS OF THE ACM, 1981, 24 (03) : 157 - 157
[10] A SENSITIVE TRANSITIVE CLOSURE ALGORITHM
EBERT, J
INFORMATION PROCESSING LETTERS, 1981, 12 (05) : 255 - 258

← 1 2 3 4 5 →