A LINEAR ALGORITHM FOR EMBEDDING PLANAR GRAPHS USING PQ-TREES

被引：100

作者：

CHIBA, N

NISHIZEKI, T

ABE, S

OZAWA, T

机构：

[1] KYOTO UNIV, FAC ENGN, KYOTO 606, JAPAN

[2] BASIC SOFTWARE CORP, SENDAI 980, JAPAN

来源：

关键词：

D O I：

10.1016/0022-0000(85)90004-2

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：54 / 76

页数：23

共 10 条

[1]

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

BOOTH, KS ;

LUEKER, GS .

[3]

CHIBA N, P SILVER JUBILEE C C

[4]

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

[5]

Even S., 1979, Graph Algorithms

[6]

GOLDSTEIN AJ, 1963, EFFICIENT CONSTRUCTI

[7]

Harary F., 1972, Graph Theory

[8] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

[9]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[10]

LEMPEL A, 1967, 1966 THEOR GRAPHS IN, P215