Min-cut replication in partitioned networks

  title={Min-cut replication in partitioned networks},
  author={L. James Hwang and Abbas El Gamal},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
AbstructLogic replication has been shown empirically to reduce pin count and partition sue in partitioned networks. This paper presents the first theoretical treatment of the min-cut replication problem, which is to determine replicated logic that minimizes cut size. A polynomial time algorithm for determining min-cut replication sets for !+partitioned graphs is derived by reducing replication to the problem of finding a maximum flow. The algorithm is extended to hypergraphs and replication… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 29 extracted citations

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-6 of 6 references

Multiterminal flows in a hypergraph , ” in VLSI Circuit Layout : Theory and Design ,

  • K. Moerder
  • Computers and Intractability : A Guide to the…
  • 1979

An efficient heuristic procedure for partitioning graphs

  • T. C. Hu, E. S. Kuh
  • The Bell Sys . Tech . J .

Similar Papers

Loading similar papers…