New algorithms for min-cut replication in partitioned circuits
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Net partitions yield better module partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A cell-replicating approach to minicut-based circuit partitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast spectral methods for ratio cut partitioning and clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A replication cut for two-way partitioningIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Min-cut replication in partitioned networksIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Optimal clustering for delay minimizationPublished by Association for Computing Machinery (ACM) ,1993
- Optimal replication for min-cut partitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization by Simulated AnnealingScience, 1983
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970