EXACT AND APPROXIMATE SOLUTIONS FOR THE GATE MATRIX LAYOUT PROBLEM

被引:45
作者
DEO, N [1 ]
KRISHNAMOORTHY, MS [1 ]
LANGSTON, MA [1 ]
机构
[1] RENSSELAER POLYTECH INST, DEPT COMP SCI, TROY, NY 12180 USA
关键词
D O I
10.1109/TCAD.1987.1270248
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
15
引用
收藏
页码:79 / 84
页数:6
相关论文
共 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]  
COHOON J, 1983 P IEEE INT C CA, P81
[3]  
FELLOWS MR, UNPUB INFORM PROCESS
[4]  
FRIESEN DK, COMMUNICATION
[5]  
Golumbic M. C., 1980, ALGORITHMIC GRAPH TH
[6]  
HOROWITZ E, 1979, FUNDAMENTALS COMPUTE
[7]  
KASHIWABARA T, 1979 P IEEE INT S CI, P82
[8]  
KIRKPATRICK S, 1982, IBM RC9355 RES REP
[9]  
LI JT, 1983 P IEEE INT S CI, P1013
[10]   A DENSE GATE MATRIX LAYOUT METHOD FOR MOS VLSI [J].
LOPEZ, AD ;
LAW, HFS .
IEEE TRANSACTIONS ON ELECTRON DEVICES, 1980, 27 (08) :1671-1675