Linear decomposition algorithm for VLSI design applications


We propose a unified solution to both linear placement and partitioning. Our approach combines the well-known eigenvector optimization method with the recursive max-flow min-cut method. A linearized eigenvector method is proposed to improve the linear placement. A hypergraph maxflow algorithm is then adopted to efficiently find the max-flow min-cut. In our… (More)
DOI: 10.1145/224841.224884

4 Figures and Tables


  • Presentations referencing similar topics