Fast hypergraph minimum cut algorithm

Wai Kei Mak, D. F. Wong

Research output: Contribution to journalConference articlepeer-review


We present the fastest algorithm known today for computing a global minimum cut in a hypergraph. Unlike most minimum cut algorithms which rely on flow computations in a network, ours is a non-flow based algorithm. Since the netlist of a circuit can be modelled naturally as a hypergraph, this opens the opportunity for finding very high quality solutions for the circuit partitioning problem.

Original languageEnglish (US)
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: May 30 1999Jun 2 1999

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast hypergraph minimum cut algorithm'. Together they form a unique fingerprint.

Cite this