AN EFFICIENT PARALLEL ALGORITHM FOR PLANARITY

被引：27

作者：

KLEIN, PN ^{[1
]}

REIF, JH ^{[1
]}

机构：

[1] DUKE UNIV, DEPT COMP SCI, DURHAM, NC 27706 USA

来源：

关键词：

D O I：

10.1016/0022-0000(88)90006-2

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：190 / 246

页数：57

共 23 条

[1]

BONDY JA, 1976, GRAPH THEORY APPLICA

BOOTH, KS ;

LUEKER, GS .

[3]

Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P511, DOI 10.1109/SFCS.1986.41

[4]

Edmonds J, 1960, NOT AM MATH SOC, V7, P646

[5]

Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4

[6]

FORTUNE S, 1978, 10TH P ANN IEEE S F, P98

[7] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

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

JAJA, J ;

SIMON, J .

[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]

KLEIN PN, 1986, THESIS MIT