Circular Permutation Layout with Prescribed Between-Pin Congestions.
| dc.contributor.author | Rim, C.S. | en_US |
| dc.contributor.author | Masuda, Sumio | en_US |
| dc.contributor.author | Nakajima, K. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:43:18Z | |
| dc.date.available | 2007-05-23T09:43:18Z | |
| dc.date.issued | 1989 | en_US |
| dc.description.abstract | Suppose that two sets of terminals t_1,t_2, ..., t_n and b_1, b_2, ... ,b_n are located on two concentric circles C_out and C_in, respectively. Given a permutation PI of integers 1, 2, ..., n, the circular permutation layout problem is the problem of connecting each pair of terminals t_i and b_PI(i) for i = 1, 2, ..., n with zero width wires in such a way that no two wires that correspond to different terminal pairs intersect each other. In this paper, we present a linear time algorithm for the following case: (i) no wire can cross C_out, (ii) a wire can cross C_in at most once, and (iii) the number of wires which can pass between each pair of adjacent terminals on C_in is prespecified. | en_US |
| dc.format.extent | 1430518 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4869 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1989-20 | en_US |
| dc.title | Circular Permutation Layout with Prescribed Between-Pin Congestions. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1