The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We consider two generalizations of the min-cut partitioning problem where the nodes of a circuit <it>C</it> are to be mapped to the vertices of an underlying graph <it>G</it>, and the cost function to be minimized is the cost of associating the nets of <it>C</it> with the edges of <it>G</it>. Let <it>P</it> be the number of pins, <it>t</it> be the number of nodes of <it>G</it>, and <it>d</it> be the maximum number of cells on a net of <it>C</it>. In the first problem the graph <it>G</it> is a tree <it>T</it>. An iterative improvement heuristic is given in [<ref rid="bibt04709" type="bib">9</ref>] with <it>O</it>(<it>P</it>·<it>t</it><super>3</super>) time per pass. Our proposed heuristic guarantees identical solutions in <it>O</it>(<it>P</it>·<it>t</it>· min{<it>d</it>, <it>t</it>}) time per pass. The second problem is defined on any graph <it>G</it>. The standard iterative improvement heuristic requires <it>O</it>(<it>P</it>·<it>t</it><super>4</super>) time per pass, but our proposed approach guarantees <it>O</it>(<it>P</it>·<it>t</it>· min{<it>d</it>, <it>t</it>}) time per pass. The problems find applications in VLSI physical design and in distributed systems.</p>
Circuit and network partitioning, iterative improvement, NP-hard.

S. Tragoudas, "Min-Cut Partitioning on Underlying Tree and Graph Structures," in IEEE Transactions on Computers, vol. 45, no. , pp. 470-474, 1996.
94 ms
(Ver 3.3 (11022016))