PARALLEL ALGORITHMIC TECHNIQUES FOR COMBINATORIAL COMPUTATION

被引：59

作者：

EPPSTEIN, D ^{[1
]}

GALIL, Z ^{[1
]}

机构：

[1] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL

来源：

关键词：

D O I：

10.1146/annurev.cs.03.060188.001313

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：233 / 283

页数：51

共 83 条

[31]

HIRSCHBERG DS, 1976, 8TH P ANN ACM S THEO, P55

ISRAELI, A ;

ITAI, A .

[33] AN IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING [J].

ISRAELI, A ;

SHILOACH, Y .

[34]

Kanevsky A., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P252, DOI 10.1109/SFCS.1987.33

[35]

KARLIN AR, 1986, 18TH P ANN ACM S THE, P160

[36]

KARP RM, 1985, 17TH P ANN ACM S THE, P22

[37]

KARP RM, 1985, 17TH S THEOR COMP, P464

[38]

Klein P. N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P465, DOI 10.1109/SFCS.1986.6

[39]

KRAPCCHENKO AN, 1970, SYST THEORY RES, V19, P105

[40] THE POWER OF PARALLEL PREFIX [J].

KRUSKAL, CP ;

RUDOLPH, L ;

SNIR, M .