EFFICIENT PLANARITY TESTING

被引：627

作者：

HOPCROFT, J ^{[1
]}

TARJAN, R ^{[1
]}

机构：

[1] CORNELL UNIV, DEPT COMP SCI, ITHACA, NY 14850 USA

来源：

关键词：

D O I：

10.1145/321850.321852

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：549 / 568

页数：20

共 44 条

[1]

AUSLANDER L, 1961, J MATH MECH, V10, P517

[2]

Berge C., 1964, THEORY GRAPHS ITS AP

[3] A NEW PLANARITY TEST BASED ON 3-CONNECTIVITY [J].

BRUNO, J ;

STEIGLITZ, K ;

WEINBERG, L .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (02) :197-+

[4]

Busacker R.G., 1965, FINITE GRAPHS NETWOR

[5]

CHUNG SH, 1970, 13 P MIDW S CIRC THE

[6]

COOK S, 1971, FOUNDATIONS INFORMAT, P174

[7]

COOK S, 1971, P IFIP C

FISHER, GJ ;

WING, O .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02) :154-&

[9]

GOLDSTEIN AJ, 1963, NONR185821 PRINC U C

[10] BACKTRACK PROGRAMMING [J].

GOLOMB, SW ;

BAUMERT, LD .