Ching-Wei Yeh
- 1.M. A. Breuer, "Design Automation of Digital S yst(~'ns', Prentice-Hall, NY, 1972Google Scholar
- 2.E. L. Lawler, IC N. Levitt and J. Turner) "Module Clustering to ~animize de.lay in Digital networks," IEEE Trans. on Computers, vol. C-18, Jan. 1969, pp. 4%57Google Scholar
- 3.W. M. Dai and E. S. Kuh, "Hierarchical Floor Planning for Building Block Layout," IEEE Conf. on Computer-Aided Design, 1986Google Scholar
- 4.T. C. Hu and E. S. Kuh, "VLSI Circuit Layout Theory and Design," IEEE Press, 1985Google Scholar
- 5.B. W. Kemighan and S. IAn, "An Efficient Heuristic Procedure for Partitioning Graphs', Ball System Technical Journal, 49(2), Feb. 1970, pp.291-307Google ScholarCross Ref
- 6.D. G. Schweikert and B. W. Kemighan, "A Proper Model for the Paedti~ning of Electrical Circuits", 9th Design Automation Workshop, 1972, pp.57-62 Google ScholarDigital Library
- 7.C. M. Fiduccia and R. M. Mattheyses, "A Linear Time Heuristic for Improving Network Pa_~tions", Proc 19th ACM/IEEE Design Automation Conf, 1982, pp.175- 181 Google ScholarDigital Library
- 8.C. Sechen and D. Chert, "An Improved Objective Function for Mincut Circuit Partitioning", Prec. Int. ConL on Compute-Aided Design, 1988, pp.502-505Google Scholar
- 9.B. Kfishnarnurthy, "An Improved Min-cut Algorithm for Paedtioning VLSI Networks', IEEE Trans. on Computers, Vol C-33, May 1984, pp.438-446Google ScholarDigital Library
- 10.L. A. Sanchis, "Multi-Way Network Partitioning', IEEE Trans. on Computers, Voi.38, No.l, Jan 1989, pp.62-81 Google ScholarDigital Library
- 11.M.R. Garey, and D.S. Johnson, "Computers and intractability: A Guide to the Theory of NP-Completeness," W.H. Freeman and Company, San Francisco, 1979 Google ScholarDigital Library
- 12.W.E. Donath, "Logic Panitioning," in "Physical Design Automation of VI~I Systems," edited by B. Preas and M. Lor(mzotti, Benjamin/Cumming Publishing Co.,1988, pp.05-86Google Scholar
- 13.Y. Wei and C. K. Cheng, "Toward Efficient Hierarchical Designs by Ratio Cut Partitioning", Proc. Int. Conf. on Computer-Aided Design, 1989, pp.298-301Google Scholar
- 14.Y. Wci and C. K. Cheng, "Two-way Two-level Partitioning Algorithm," to appear in IEEE Int. Conf. on Computer Aided D(~gn, 1990Google Scholar
- 15.L. R. Ford and D. R. Fulkerson, "Flows in Networks", Princeton University Press, 1962Google Scholar
- 16.M. V. Lomonosov, "Combinatorial Approachvs to Multiflow Problems," Discrete Applied Mathematics 1 i(I) 1985, pp.l-94Google Scholar
- 17.T. Bui, C. Heigham, C. Jones, and T. Ldghton, "Improving the Porformanc~ of the Kemighan-L~ and Simulated Annealing Graph Bisection Algorithms," Proc 26th ACMAEEE Design Automation Conf., 1989, pp.775-778 Google ScholarDigital Library
- 18.A. B. Kahng, "Fast Hype, rgraph Partition," Proc 26th ACMAEEE Design Automarion Ccaff., 1989, pp.762-766 Google ScholarDigital Library
- 19.L. Pillage and R. A. Rohr~, "A Quadratic Metric with a Simple Solution Scheme for Initial Placement," Prec. 25th ACM/IEEE Design Automation Conf., 198g, pp.324-329 Google ScholarDigital Library
Index Terms
- A general purpose multiple way partitioning algorithm
Recommendations
A general purpose, multiple-way partitioning algorithm
Multiple-way partitioning is an important extension of two-way partitioning as it provides a more natural and direct model for many partitioning applications. In this paper, we discuss several objective functions derived from such an extension and ...
Application of fusion-fission to the multi-way graph partitioning problem
PPAM'07: Proceedings of the 7th international conference on Parallel processing and applied mathematicsThis paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized cut partitioning problem. Its application to the multi-way graph ...
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, ...
Comments