A fast hypergraph min-cut algorithm for circuit partitioning

DOI10.1016/S0167-9260(00)00008-0zbMath0974.68252MaRDI QIDQ2734604

D. F. Wong, Wai-Kei Mak

Publication date: 20 August 2001

Published in: Integration (Search for Journal in Brave)

zbMATH Keywords

hypergraphminimum cutcircuit partitioningflow-based algorithmmin-cut partitioningnon-flow-based algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (9)

Minimum Cuts and Sparsification in Hypergraphs ⋮ Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Finding minimum 3-way cuts in hypergraphs

This page was built for publication: A fast hypergraph min-cut algorithm for circuit partitioning