A fast hypergraph min-cut algorithm for circuit partitioning
Authors:
- Wai-Kei MakWMWai-Kei Mak
- D.F. WongDWD.F. Wong
- 1 November 2000
- journal article
- Published by Elsevier in Integration
- Vol. 30 (1) , 1-11
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A simple min-cut algorithmJournal of the ACM, 1997
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Modeling hypergraphs by graphs with the same mincut propertiesInformation Processing Letters, 1993
- Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics, 1992