On the layering problem of multilayer PWB wiring

Authors:
Shuji Tsukiyama;Ernest S. Kuh;Isao Shirakawa
Affiliations:
-;-;-
Venue:
DAC '81 Proceedings of the 18th Design Automation Conference
Year:
1981

Citing 2
Cited 1

A topologically based non-minimum distance routing algorithm

DAC '78 Proceedings of the 15th Design Automation Conference
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Optimal single row router

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the layering problem of multilayer PWB wiring, associated with single-row routing. The problem to be considered is restricted to the special case of street capacities up to two in each layer, and it is reduced to a problem of the interval graph by relaxing some restrictions in the original problem. Then, a hèuristic algorithm is proposed for this problem.