ONLINE COMPUTATION OF TRANSITIVE CLOSURES OF GRAPHS

被引：41

作者：

IBARAKI, T ^{[1
]}

KATOH, N ^{[1
]}

机构：

[1] KOBE UNIV COMMERCE,DEPT MANAGEMENT SCI,KOBE,JAPAN

来源：

关键词：

D O I：

10.1016/0020-0190(83)90033-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：95 / 97

页数：3

共 9 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

BOOTH KS, 1977, SIGACT NEWS

[3]

EVEN S, 1981, J ACM, V28, P1, DOI 10.1145/322234.322235

[4]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P294, DOI 10.1137/0202024

[5]

SLEATOR DD, 1980, THESIS STANFORD U

[6] GAUSSIAN ELIMINATION IS NOT OPTIMAL [J].

STRASSEN, V .

[7] EFFICIENCY OF A GOOD BUT NOT LINEAR SET UNION ALGORITHM [J].

TARJAN, RE .

[8]

WINOGRAD S, 1982, 7TH P IBM S MATH F C

[9]

[No title captured]