Issue No. 12 - December (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.260640
<p>An adaptation to multiple blocks of a two-block network partitioning algorithm by Krishnamurthy was previously presented and analyzed by the author. The algorithm assumed one of several possible generalizations of two-way partitioning to multiple-way partitioning. The problem of adapting this algorithm to work with different generalizations more suitable for other types of applications of network partitioning is considered. It is shown that certain portions of the algorithm must be revised in order to maintain a relatively low time complexity for the modified algorithms. Experimental results are given.</p>
circuit layout CAD; computational complexity; VLSI; multiple-way network partitioning; two-block network partitioning algorithm; low time complexity.
L.A. Sanchis, "Multiple-Way Network Partitioning with Different Cost Functions", IEEE Transactions on Computers, vol. 42, no. , pp. 1500-1504, December 1993, doi:10.1109/12.260640