O (NORMAL-2) ALGORITHMS FOR GRAPH PLANARIZATION

被引：39

作者：

JAYAKUMAR, R

THULASIRAMAN, K

SWAMY, MNS

机构：

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1989年 / 8卷 / 03期

关键词：

D O I：

10.1109/43.21845

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：257 / 267

页数：11

共 15 条

[1] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].

BOOTH, KS ;

LUEKER, GS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :335-379

[2]

CHIBA T, 1979 P IEEE INT S CI, P649

[3] ST-ORDERING THE VERTICES OF BICONNECTED GRAPHS [J].

EBERT, J .

COMPUTING, 1983, 30 (01) :19-33

[4]

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

[5]

Even S., 1979, GRAPH ALGORITHMS

[6] COMPUTER RECOGNITION AND EXTRACTION OF PLANAR GRAPHS FROM INCIDENCE MATRIX [J].

FISHER, GJ ;

WING, O .

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

[7]

Garey MR., 1979, COMPUTERS INTRACTABI

[8] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

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

[9] PLANAR EMBEDDING - LINEAR-TIME ALGORITHMS FOR VERTEX PLACEMENT AND EDGE ORDERING [J].

JAYAKUMAR, R ;

THULASIRAMAN, K ;

SWAMY, MNS .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (03) :334-344

[10]

LEMPEL A, 1967, JUL INT S THEOR GRAP, P215

← 1 2 →