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 条

[21] ALGORITHM FOR TRANSITIVE CLOSURE WITH LINEAR EXPECTED TIME
SCHNORR, CP
SIAM JOURNAL ON COMPUTING, 1978, 7 (02) : 127 - 133
[22] Subpath acyclic digraphs
McMorris, FR
Mulder, HM
DISCRETE MATHEMATICS, 1996, 154 (1-3) : 189 - 201
[23] Kernels for acyclic digraphs
Elzinga, Cees H.
Wang, Hui
PATTERN RECOGNITION LETTERS, 2012, 33 (16) : 2239 - 2244
[24] AN EFFICIENT PARALLEL ALGORITHM FOR THE TRANSITIVE CLOSURE OF A GRAPH
FRAISSE, P
JOURNAL OF SYSTEMS AND SOFTWARE, 1986, 6 (1-2) : 165 - 168
[25] Subpath acyclic digraphs
Discrete Math, 1-3 (189):
[26] INTERVAL ACYCLIC DIGRAPHS
HARARY, F
KABELL, JA
MCMORRIS, FR
ARS COMBINATORIA, 1990, 29A : 59 - 64
[27] Subpath acyclic digraphs
Department of Mathematics, University of Louisville, Louisville, KY 40292, United States
不详
Discrete Math, 1-3 (189-201):
[28] Multiplicativity of acyclic digraphs
Zhou, HS
DISCRETE MATHEMATICS, 1997, 176 (1-3) : 263 - 271
[29] NEARLY ACYCLIC DIGRAPHS
ZELINKA, B
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1983, 33 (01) : 164 - 165
[30] SUBTREE ACYCLIC DIGRAPHS
HARARY, F
KABELL, JA
MCMORRIS, FR
ARS COMBINATORIA, 1992, 34 : 93 - 95

← 1 2 3 4 5 →