EMBEDDING GRAPHS IN BOOKS - A LAYOUT PROBLEM WITH APPLICATIONS TO VLSI DESIGN

被引：170

作者：

CHUNG, FRK

LEIGHTON, FT

ROSENBERG, AL

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

[2] MIT,DEPT MATH,CAMBRIDGE,MA 02139

[3] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

[4] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1987年 / 8卷 / 01期

关键词：

D O I：

10.1137/0608002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：33 / 58

页数：26

共 31 条

[1]

ARNOLD PB, 1982, TR2282 HARV U CTR RE

[2] OPTIMAL REARRANGEABLE MULTISTAGE CONNECTING NETWORKS [J].

BENES, VE .

BELL SYSTEM TECHNICAL JOURNAL, 1964, 43 (4P2) :1641-+

[3] BOOK THICKNESS OF A GRAPH [J].

BERNHART, F ;

KAINEN, PC .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (03) :320-331

[4] A FRAMEWORK FOR SOLVING VLSI GRAPH LAYOUT PROBLEMS [J].

BHATT, SN ;

LEIGHTON, FT .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :300-343

[5]

BRENT RP, 1980, INFORM PROCESS LETT, V11, P44

[6]

BUSS J, 1984, 16TH P ANN ACM S THE, P98

[7]

DOLEV D, 1982, IBM RJ3368 REP

[8]

Erdos P., 1935, COMPOS MATH, V2, P463

[9]

Even S., 1971, THEORY MACHINES COMP, P71, DOI DOI 10.1016/B978-0-12-417750-5.50011-7

[10]

GALIL Z, 1986, 18TH ANN ACM S THEOR

← 1 2 3 4 →