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 Citations (Scopus)

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

Fingerprint

Linear programming
Computational complexity

ASJC Scopus subject areas

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

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.

On a graph partitioning problem with applications to VLSI layout. / Sen, Arunabha; Deng, Haiyong; Guha, Sumanta.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5 Publ by IEEE, 1991. p. 2846-2849.

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

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, Publ by IEEE, pp. 2846-2849, 1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5), Singapore, Singapore, 6/11/91.
Sen A, Deng H, Guha S. On a graph partitioning problem with applications to VLSI layout. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5. Publ by IEEE. 1991. p. 2846-2849
Sen, Arunabha ; Deng, Haiyong ; Guha, Sumanta. / On a graph partitioning problem with applications to VLSI layout. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5 Publ by IEEE, 1991. pp. 2846-2849
@inproceedings{c0252a21404347a29a37f9fee0ca2e56,
title = "On a graph partitioning problem with applications to VLSI layout",
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",
author = "Arunabha Sen and Haiyong Deng and Sumanta Guha",
year = "1991",
language = "English (US)",
volume = "5",
pages = "2846--2849",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On a graph partitioning problem with applications to VLSI layout

AU - Sen, Arunabha

AU - Deng, Haiyong

AU - Guha, Sumanta

PY - 1991

Y1 - 1991

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=0026406240&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026406240&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026406240

VL - 5

SP - 2846

EP - 2849

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

ER -