ON MINIMAL-NODE-COST PLANAR EMBEDDINGS

被引:49
作者
STORER, JA
机构
关键词
D O I
10.1002/net.3230140202
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:181 / 212
页数:32
相关论文
共 33 条
[1]   INFORMATION-TRANSFER AND AREA-TIME TRADEOFFS FOR VLSI MULTIPLICATION [J].
ABELSON, H ;
ANDREAE, P .
COMMUNICATIONS OF THE ACM, 1980, 23 (01) :20-23
[2]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[3]  
AHO AV, 1976, NETWORKS, V7, P37
[4]  
AKERS SB, 1970, 7TH P DES AUT WORKSH, P7
[5]  
[Anonymous], [No title captured]
[6]  
BRENT RP, 1979, AREA TIME COMPLEXITY
[7]  
DUNLOP AE, 1980, COMMUNICATION
[8]  
DUNLOP AE, 1980, UNPUB 17TH P DES AUT
[9]  
Even S., 1979, GRAPH ALGORITHMS
[10]  
FISCHER MJ, 1980, 12 P ACM STOC, P177