This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
May 1984 (vol. 33 no. 5)
pp. 438-446
B. Krishnamurthy, General Electric Research and Development Center
Recently, a fast (linear) heuristic for improving min-cut partitions of VLSI networks was suggested by Fiduccia and Mattheyses [6]. In this-paper we generalize their ideas and suggest a class of increasingly sophisticated heuristics. We then show, by exploiting the data structures originally suggested by them, that the computational complexity of any specific heuristic in the suggested class remains linear in the size of the network.
Index Terms:
VLSI layout, Partitioning algorithms
Citation:
B. Krishnamurthy, "An Improved Min-Cut Algonthm for Partitioning VLSI Networks," IEEE Transactions on Computers, vol. 33, no. 5, pp. 438-446, May 1984, doi:10.1109/TC.1984.1676460
Usage of this product signifies your acceptance of the Terms of Use.