Fast hypergraph min-cut algorithm for circuit partitioning

Integration, the VLSI Journal

Volumn 30, Issue 1, 2000, Pages 1-11

  Mak, Wai Kei ^a,b,c,d   Wong, D F ^b,e  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^e UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; INTEGRATED CIRCUIT LAYOUT; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS;

CIRCUIT PARTITIONING; FLOW-BASED ALGORITHMS; MIN-CUT PARTITIONING;

VLSI CIRCUITS;

EID: 0034427497     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(00)00008-0     Document Type: Article

References (12)

1. B. Preas, M. Lorenzetti, Physical Design Automation of VLSI Systems, Benjamin/Cummings, Menlo Park, CA, 1988.
2. C.J. Alpert, A.B. Kahng, Recent directions in netlist partitioning: a survey, Integration VLSI J. 19 (1-2) (1995) 1-81.
3. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
4. J.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
5. D.R. Karger, C. Stein, A new approach to the minimum cut problem, J. ACM 43 (4) (1996) 601-640.
6. H. Nagamochi, T. Ibaraki, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math. 5 (1) (1992) 54-66.
7. M. Stoer, F. Wagner, A simple min-cut algorithm, J. ACM 44 (4) (1997) 585-591.
8. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, New York-Stuttgart, 1990.
9. E. Ihler, D. Wagner, F. Wagner, Modeling hypergraphs by graphs with the same mincut properties, Inform. Process. Lett. 45 (4) (1993) 171-175.
10. T.C. Hu, K. Moerder, Multiterminal flows in a hypergraph, VLSI Circuit Layout: Theory and Design, IEEE Press, New York, 1985, pp. 87-93.
11. H. Yang, D.F. Wong, Efficient network flow based min-cut balanced partitioning, Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1994, pp. 50-55.
12. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.