FINDING A MAXIMUM PLANAR SUBSET OF A SET OF NETS IN A CHANNEL

被引：83

作者：

SUPOWIT, KJ ^{[1
]}

机构：

[1] HEWLETT PACKARD CO,DEPT DESIGN AUTOMAT,PALO ALTO,CA 94304

来源：

关键词：

D O I：

10.1109/TCAD.1987.1270250

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：93 / 94

页数：2

共 7 条

[1]

Chiba T., 1979, Proceedings of the 1979 International Symposium on circuits and systems, P649

[2]

DOLEV D, 1981, 13TH P ANN ACM S THE, P312

[3]

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

[4]

Gavril F., 1973, NETWORKS, V3, P261, DOI DOI 10.1002/NET.3230030305

[5]

Karp R. M., 1972, COMPLEXITY COMPUTER, P85

[6]

Marek-Sadowska M., 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, VCAD-2, P246, DOI 10.1109/TCAD.1983.1270042

[7] AN OPTIMAL SOLUTION TO A WIRE-ROUTING PROBLEM [J].

TOMPA, M .