PARALLEL EAR DECOMPOSITION SEARCH (EDS) AND ST-NUMBERING IN GRAPHS

被引：65

作者：

MAON, Y ^{[1
]}

SCHIEBER, B ^{[1
]}

VISHKIN, U ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10012

来源：

关键词：

D O I：

10.1016/0304-3975(86)90153-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：277 / 298

页数：22

共 20 条

[1] SORTING IN C LOG N PARALLEL STEPS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
[2] ANDERSON R, 1985, 17TH P ACM S THEOR C, P33
[3] Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P478, DOI 10.1109/SFCS.1986.10
[4] Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4
[5] Even S., 1979, GRAPH ALGORITHMS
[6] FISHER M, 1980, J ASSOC COMPUT MACH, V27, P831
[7] Itai A., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P137, DOI 10.1109/SFCS.1984.715910
[8] PARALLEL ALGORITHMS IN GRAPH-THEORY - PLANARITY TESTING
JAJA, J
SIMON, J
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (02) : 314 - 328
[9] Klein P. N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P465, DOI 10.1109/SFCS.1986.6
[10] LEMPEL A, 1967, 1966 THEOR GRAPHS IN, P215