CIRCUIT PARTITIONING WITH SIZE AND CONNECTION CONSTRAINTS (EXTENDED ABSTRACT).

Yehoshua Perl, Marc Snir

Research output: Contribution to conferencePaper

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 languageEnglish (US)
Pages80-84
Number of pages5
StatePublished - Dec 1 1982
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'CIRCUIT PARTITIONING WITH SIZE AND CONNECTION CONSTRAINTS (EXTENDED ABSTRACT).'. Together they form a unique fingerprint.

  • Cite this