Multiple-Way Network Partitioning

IEEE Transactions on Computers

Volumn 38, Issue 1, 1989, Pages 62-81

  Sanchis, Laura A ^a  

^a UNIVERSITY OF ROCHESTER   (United States)

Author keywords

Approximation algorithms; heuristics; network partitioning

Indexed keywords

INTEGRATED CIRCUITS, VLSI--LAYOUT; MATHEMATICAL TECHNIQUES--HEURISTIC;

APPROXIMATION ALGORITHMS; ITERATIVE IMPROVEMENT ALGORITHMS; NETWORK PARTITIONING;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024481167     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.8730     Document Type: Article

References (14)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wes-ley, 1974.
2. E.R. Barnes, “An algorithm for partitioning the nodes of a graph,” Tech. Rep. IBM T.J. Watson Research Center, Dep. Comput. Sci., Feb. 1981.
3. M.A. Breuer, “A class of min-cut placement algorithms,” in Proc. 14th Design Automat. Con/., 1977, pp. 284–290.
4. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, “Graph bisection algorithms with good average case behavior,” in Proc. 25th Annu. Conf. Foundations Comput. Sci., Oct. 1984, pp. 181–191.
5. M. Burstein, “Partitioning of VLSI networks,” Tech. Rep., IBM T.J. Watson Research Center, Nov. 1981.
6. C.M. Fiduccia and R.M. Mattheyses, “A linear-time heuristic for improving network partitions,” in Proc. 19th Design Automat. Conf., 1982, pp. 175–181.
7. M.R. Garey and D.S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
8. M.K. Goldberg and M. Burstein, “Heuristic improvement technique for bisection of VLSI networks,” Tech. Rep., IBM T.J. Watson Research Center, July 1983.
9. M.K. Goldberg, S. Lath, and J.W. Robert, “Heuristics for the graph bisection problem” Tech. Rep. 86–8, Rensselaer Polytechnic Institute, 1986.
10. B.W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, pp. 291–307, Feb. 1970.
11. B. Krishnamurthy, “Constructing test cases for partitioning heuristics,” IEEE Trans. Comput., vol. C-36, Sept. 1987.
12. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Trans. Comput., vol. C-33, pp. 438–446, May 1984.
13. L.A. Sanchis, “Multiple-way network partitioning,” Tech. Rep. TR181, Dep. Comput. Sci., Univ. Rochester, Apr. 1986.
14. D.G. Schweikert and B.W. Kernighan, “A proper model for the partitioning of electrical circuits,” in Proc. 9th Design Automat. Workshop, June 1979, pp. 57–62.