This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiple-Way Network Partitioning with Different Cost Functions
December 1993 (vol. 42 no. 12)
pp. 1500-1504

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.

[1] Barnes, Vanelli, and Walker, "A new heuristic for partitioning the nodes of a graph,"SIAM J. Discrete Mathemat., vol. 1, 1988.
[2] M. A. Breuer, "A class of min-cut placement algorithms," inProc. 14th Des. Automat. Conf., 1977, pp. 284-290.
[3] T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, "Graph bisection algorithms with good average case behavior," inProc. 25th Annual Symp. Found. Computer Sci., Oct. 1984, pp. 181-191.
[4] C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions," inProc. 19th Design Automat. Conf., 1982, pp. 175-181.
[5] M. K. Goldberg and M. Burstein, "Heuristic improvement technique for bisection of VLSI networks," IBM T. J. Watson Research Center, Tech. Rep., July 1983.
[6] M. K. Goldberg, S. Lath, and J. W. Robert, "Heuristics for the graph bisection problem," Rensselaer Polytechnic Institute, Tech. Rep. 86-8, 1986.
[7] B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs,"Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970.
[8] B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks,"IEEE Trans. Comput., vol. C-33, pp. 438-446, May 1984.
[9] L. A. Sanchis, "Multiple-way network partitioning,"IEEE Trans. Comput., vol. C-38, pp. 62-81, Jan. 1989.
[10] D. G. Schweikert and B. W. Kernighan, "A proper model for the partitioning of electrical circuits," inProc. 9th Des. Automation Workshop, June 1979, pp. 57-62.
[11] L. A. Sanchis, "Multiple-way network partitioning with different cost functions," Colgate Univ., Hamilton, NY,, Tech. Rep. TR-1992-1, Feb. 1992.

Index Terms:
circuit layout CAD; computational complexity; VLSI; multiple-way network partitioning; two-block network partitioning algorithm; low time complexity.
Citation:
L.A. Sanchis, "Multiple-Way Network Partitioning with Different Cost Functions," IEEE Transactions on Computers, vol. 42, no. 12, pp. 1500-1504, Dec. 1993, doi:10.1109/12.260640
Usage of this product signifies your acceptance of the Terms of Use.