Abstract
In this paper, we present an O(n2) time algorithm that obtains a single jog minimum area joining of two compacted cells.
| Original language | English |
|---|---|
| Pages (from-to) | 167-172 |
| Number of pages | 6 |
| Journal | Information Processing Letters |
| Volume | 47 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 27 Sept 1993 |
Keywords
- Algorithms
- VLSI design
- cell joining
- cell stretching
- compacted cells
- river routing
- single jog
- symbolic sticks designs