๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum replication min-cut partitioning

โœ Scribed by Wai-Kei Mak; Wong, D.F.

Book ID
119778249
Publisher
IEEE
Year
1997
Tongue
English
Weight
229 KB
Volume
16
Category
Article
ISSN
0278-0070

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A replication cut for two-way partitioni
A replication cut for two-way partitioning
โœ Lung-Tien Liu; Ming-Ter Kuo; Chung-Kuan Cheng; Hu, T.C. ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› IEEE ๐ŸŒ English โš– 791 KB
A fast hypergraph min-cut algorithm for
A fast hypergraph min-cut algorithm for circuit partitioning
โœ Wai-Kei Mak; D.F. Wong ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between di!erent components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut pro

An improved circuit-partitioning algorit
An improved circuit-partitioning algorithm based on min-cut equivalence relation
โœ Xianyang Jiang; Xubang Shen; Tianxu Zhang; Huayu Liu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

Network flow is an excellent approach to finding min-cuts in network because of the celebrated maxflow/min-cut theorem. For a long time, however, it has not been a practical circuit partitioning method for its relatively high computational complexity. Algorithm FBB is the first one to apply network