Title :
Partitioning a network into n pieces with a time-efficient net cost function
Author_Institution :
Delft Univ. of Technol., Netherlands
Abstract :
Discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear-time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results
Keywords :
VLSI; circuit layout CAD; Fiduccia-Mattheyses linear time bi-partitioning algorithm; O(log n) time; cost of arbitrarily large spanning trees; generalization; heuristic cost function; linear-time n-partitioning algorithm; network partitioning into n pieces; time-efficient net cost function; Computer networks; Cost function; Data structures; Iterative algorithms; Partitioning algorithms; Pins;
Conference_Titel :
Design Automation. EDAC., Proceedings of the European Conference on
Conference_Location :
Amsterdam
DOI :
10.1109/EDAC.1991.206385
