SYMMETRIC COMPLEMENTATION

被引：27

作者：

REIF, JH

机构：

来源：

JOURNAL OF THE ACM | 1984年 / 31卷 / 02期

关键词：

D O I：

10.1145/62.322436

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：401 / 421

页数：21

共 32 条

[11] CHARACTERIZATION OF COMPARABILITY GRAPHS + OF INTERVAL GRAPHS [J].

GILMORE, PC ;

HOFFMAN, AJ .

CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03) :539-&

[12] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].

HIRSCHBERG, DS ;

CHANDRA, AK ;

SARWATE, DV .

COMMUNICATIONS OF THE ACM, 1979, 22 (08) :461-464

[13]

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

[14] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

JOURNAL OF THE ACM, 1974, 21 (04) :549-568

[15] EFFICIENT ALGORITHMS FOR GRAPH MANIPULATION [J].

HOPCROFT, J ;

TARJAN, R .

COMMUNICATIONS OF THE ACM, 1973, 16 (06) :372-378

[16] PARALLEL ALGORITHMS IN GRAPH-THEORY - PLANARITY TESTING [J].

JAJA, J ;

SIMON, J .

SIAM JOURNAL ON COMPUTING, 1982, 11 (02) :314-328

[17]

JAJA J, 1980, 17TH P ALL C, P677

[18] NEW PROBLEMS COMPLETE FOR NONDETERMINISTIC LOG SPACE [J].

JONES, ND ;

LIEN, YE ;

LAASER, WT .

MATHEMATICAL SYSTEMS THEORY, 1976, 10 (01) :1-17

[19]

KARP R, 1980, 12TH P ACM S THEOR C, P302

[20] SYMMETRIC SPACE-BOUNDED COMPUTATION [J].

LEWIS, HR ;

PAPADIMITRIOU, CH .

THEORETICAL COMPUTER SCIENCE, 1982, 19 (02) :161-187

← 1 2 3 4 →