GRAPH THEORETIC ALGORITHMS FOR THE PLA FOLDING PROBLEM

被引:18
作者
LECKY, JE
MURPHY, OJ
ABSHER, RG
机构
关键词
D O I
10.1109/43.35554
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1014 / 1021
页数:8
相关论文
共 14 条
[1]   FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH [J].
BALAS, E ;
YU, CS .
SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1054-1068
[2]  
Bollobas B., 1985, RANDOM GRAPHS
[3]  
De Micheli G., 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, VCAD-2, P151, DOI 10.1109/TCAD.1983.1270033
[4]   BIPARTITE FOLDING AND PARTITIONING OF A PLA [J].
EGAN, JR ;
LIU, CL .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1984, 3 (03) :191-199
[5]  
FLEISHER H, 1975, IBM J RES DEV MAR, P98
[6]  
Garey M.R., 1979, COMPUTERS INTRACTABI
[7]   LOWER BOUNDS ON THE INDEPENDENCE NUMBER IN TERMS OF THE DEGREES [J].
GRIGGS, JR .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (01) :22-39
[8]   COLORING RANDOM GRAPHS [J].
GRIMMETT, GR ;
MCDIARMID, CJH .
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1975, 77 (MAR) :313-324
[9]  
Hachtel G. D., 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, VCAD-1, P63, DOI 10.1109/TCAD.1982.1269996
[10]   BEST-FIRST SEARCH ALGORITHM FOR OPTIMAL PLA FOLDING. [J].
Hwang, Sun Young ;
Dutton, Robert W. ;
Blank, Tom .
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986, CAD-5 (03) :433-442