1.0 Partitioning

H. Yang, D.F. Wong, "Efficient Netowrk Flow Based Min-Cut Balanced Partitioning," Proc. ICCAD '94, pp. 50-55.

2. J. Cong, L. Hagen, A. Kahng, ''Net Partitions Yield Better Module Partitions,'' Proc 29th Design Automation Conference, pp. 47-52, June 1992.

3. B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs" Bell System Technical Journal, Vol. 49, No. 2, pp.291-307, Feb. 1970.

4. C.M. Fiduccia and R.M. Mattheyses, "A Linear-Time Heuristic for Improving Network Partitions", 19th ACM/IEEE Design Automation Conference, pp. 175-181, pp. 1982.

5. S. Kirkpatrick, C.D. Gelatt, Jr., M.P. Vecchi, "Optimization by Simulated Annealing", Science, Vol. 220, No. 4598, pp. 671-680, May 1983.