Partitioning is a critical area of VLSI CAD. In order to build complex digital logic circuits it is often essential to sub-divide a circuit into smaller parts. Circuit partitioning plays an important role in physical design automation of very large scale integration (VLSI) chips. In VLSI circuit partitioning the problem of obtaining minimum cut is of prime importance. To enhance other criteria like power, delay and area in addition to minimum cit is included.

1. FrankM. Johannes Institute of Electronic Design Automation ECE Department, Technical University of Munich Arcisstr. 21, D-80333 Munich, Germany E-mail: Johannes@e-technik. tu-muenchen. de
2. Johannes, F. M," Partitioning of VLSI circuits and systems", This paper appears in Design Automation Conference Proceedings 1996,33rd Publication Date: 3-7 Jun, 1996 On page(s): 83-87
3. B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs", Bell System Tech. Journal volume. 49,Feb. 1970, pp. 291-307.
4. C. M. Fiduccia and R. M. Mattheyses, "A Linear-time heuristic for Improving Network partitions" Proc. ACM/IEEE Design Automation Conf. , 1982, pp 175-181
5. Augeri,C. J. ;Ali,H. H "New Graph Based Algorithms For Partitioning VLSI Circuits"Circuits aSystems ,2004. ISCAS apos ;04. Proceeding of the 2004 International Symposium on Volume 3,Issue , 23-26 May 2004
6. . Raslam Hasim Al Abaji Evolutinary techniques for partitioning VlSI circuits. Department of computer engineering May 2001.
7. . K. A Sumitra Devi ,N. P Banashree and Annamma Abraham. Comparitive study of Evolutionary Model and Clustering Methods in VLSI circuit Partitioning.

Vlsi Circuit Partitioning delay cut Size