Conference paper
Wiring and crosstalk avoidance in multi-chip module design
Howard H. Chen, C.K. Wong
CICC 1992
The problem considered here is that of permuting the pins of modules in order to maximize the number of connections which can be achieved in the polysilicon level. Using a graph-theoretic formulation, the problem is shown to be equivalent to that of removing fewest edges in a certain graph to break all cycles. The problem is proved to be NP-complete. A heuristic based on branch-and-bound is proposed. © 1984.
Howard H. Chen, C.K. Wong
CICC 1992
Shou-Hsuan Stephen Huang, C.K. Wong
Acta Informatica
Xiaoyun Lu, Da-Wei Wang, et al.
Discrete Mathematics
D.T. Lee, Hsu Chang, et al.
IEEE TC