An Improvement of Network-Flow Based Multi-Way Circuit Partitioning Algorithm

[1]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD.

[2]  Atsushi Takahashi,et al.  Enumerating the min-cuts for applications to graph extraction under size constraints , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[3]  Joan Aldous,et al.  Networks and algorithms - an introductory approach , 1993 .

[4]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[5]  Martin D. F. Wong,et al.  Network-flow-based multiway partitioning with area and pin constraints , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[7]  Kengo R. Azegami,et al.  An Efficient Algorithm to Extract an Optimal Sub-Circuit by the Minimum Cut , 2001 .

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Jaeseok Kim,et al.  An Efficient Method of Partitioning Circuits for Multiple-FPGA Implementation. , 1993, 30th ACM/IEEE Design Automation Conference.

[11]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.