Partitioning logic on graph structures to minimize routing cost
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 9 (12) , 1326-1334
- https://doi.org/10.1109/43.62777
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Multiple-way network partitioningIEEE Transactions on Computers, 1989
- Min-cost partitioning on a tree structure and applicationsPublished by Association for Computing Machinery (ACM) ,1989
- A global router based on a multicommodity flow modelIntegration, 1987
- Mason: A Global Floorplanning Approach for VLSI DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- An Improved Min-Cut Algonthm for Partitioning VLSI NetworksIEEE Transactions on Computers, 1984
- Multicommodity flows in graphsDiscrete Applied Mathematics, 1983
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Two-Commodity FlowJournal of the ACM, 1978
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970