This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalization of Min-Cut Partitioning to Tree Structures and its Applications
March 1991 (vol. 40 no. 3)
pp. 307-314

A generalization of the min-cut partitioning problem, called min-cost tree partitioning, is introduced. In the generalized problem. the nodes of a hypergraph G are to be mapped onto the vertices of a tree structure T, and the cost function to be minimized is the cost of routing the hyperedges of G on the edges of T. The standard min-cut problem is the simple case in which the tree T is a single edge connecting two vertices. Several VLSI design applications for this problem are discussed. An iterative improvement heuristic for this problem in which nodes of the hypergraph are moved between the vertices of the tree is described. The running time of a single pass of the heuristic for the unweighted version of the problem is Q(P*D*t/sup 3/), where P is the total number of pins in the hypergraph G, D is the maximum number of nodes in a hyperedge of G, and t is the number of vertices in the tree T. Several test results are discussed.

[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[2] I. Bhandari, M. Hirsch, and D. Siewiorek, "The min-cut shuffle: Toward a solution for the global effect problem of min-cut placement," inProc. 25th ACM/IEEE Design Automat. Conf., Anaheim, CA, June 1988.
[3] A. E. Dunlop, "A procedure for placement of standard cell VLSI circuits,"IEEE Trans. Comput.-Aided Design Integrated Circuits Syst., vol. CAD-4, 1985.
[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. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[6] B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs,"Bell Syst. Tech. J., vol. 49, Feb. 1970.
[7] B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks,"IEEE Trans. Comput., vol. C-33, no. 5, May 1984.
[8] D. Lapotin and S. W. Director, "Mason: A global floorplanning approach for VLSI design,"IEEE Trans. Comput.-Aided Design Integrated Circuits Syst.vol. CAD-5, 1986.
[9] L. A. Sanchis, "Multiple-way network partitioning,"IEEE Trans. Comput., vol. 38, no. 1, pp. 62-81, Jan. 1989.

Index Terms:
minimisation; min-cut partitioning; tree structures; nodes; hypergraph; vertices; cost function; routing; hyperedges; VLSI design applications; iterative improvement heuristic; pins; computational complexity; data structures; minimisation; trees (mathematics).
Citation:
G. Vijayan, "Generalization of Min-Cut Partitioning to Tree Structures and its Applications," IEEE Transactions on Computers, vol. 40, no. 3, pp. 307-314, March 1991, doi:10.1109/12.76407
Usage of this product signifies your acceptance of the Terms of Use.