Abstract
The problem of partitioning a circuit into subcomponents with constraints on the size of each subcomponent and the number of external connections is examined. While this problem is shown to be NP‐complete even for very restricted cases, a pseudo‐polynomial dynamic programming algorithm is given for the case where the circuit has a tree structure.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 365-375 |
| Number of pages | 11 |
| Journal | Networks |
| Volume | 13 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1983 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications