Multilevel Hypergraph Partitioning: Application In Vlsi Domain

This publication has 15 references indexed in Scilit:

• A probability-based approach to VLSI circuit partitioning
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• An evaluation of bipartitioning techniques
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Partitioning very large circuits using analytical placement techniques
  Published by Association for Computing Machinery (ACM) ,1994
• Modeling hypergraphs by graphs with the same mincut properties
  Information Processing Letters, 1993
• A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design
  Published by Association for Computing Machinery (ACM) ,1993
• A new approach to effective circuit clustering
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
  Published by Association for Computing Machinery (ACM) ,1989
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks
  IEEE Transactions on Computers, 1984
• A Linear-Time Heuristic for Improving Network Partitions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• An Efficient Heuristic Procedure for Partitioning Graphs
  Bell System Technical Journal, 1970