On a graph partitioning problem with applications to VLSI layout

Arunabha Sen, Haiyong Deng, Sumanta Guha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

A graph partitioning problem with application to VLSI layout is discussed. It has been shown that for a general graph the partitioning problem is NP-complete. It is also shown that the open problem suggested by K. J. Supowit (1987) is also NP-complete. An integer linear programming formulation for the graph partitioning problem is given. The problem can then be solved using one of the several methods for solving integer linear programming problems. A linear time algorithm for the case when the graph is a tree is given

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages2846-2849
Number of pages4
Volume5
StatePublished - 1991
Event1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5) - Singapore, Singapore
Duration: Jun 11 1991Jun 14 1991

Other

Other1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5)
CitySingapore, Singapore
Period6/11/916/14/91

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'On a graph partitioning problem with applications to VLSI layout'. Together they form a unique fingerprint.

  • Cite this

    Sen, A., Deng, H., & Guha, S. (1991). On a graph partitioning problem with applications to VLSI layout. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 5, pp. 2846-2849). Publ by IEEE.