Abstract
Deciding if a graph has a VLSI layout with a specified maximum edge length is NP-complete.
Original language | English |
---|---|
Pages (from-to) | 263-267 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 25 |
Issue number | 4 |
DOIs | |
State | Published - 17 Jun 1987 |
Keywords
- NP-completeness
- VLSI layout
- wire length