A fast minimum cost flow algorithm for VLSI layout compaction

Autor:	Yuji Shigehiro, H. Takahashi, I. Arungsrisangchai, Isao Shirakawa
Rok vydání:	2002
Předmět:	Physics::Fluid Dynamics Very-large-scale integration Application-specific integrated circuit Flow (mathematics) Computer science Compaction Minimum-cost flow problem Directed graph Algorithm Integrated circuit layout IC layout editor Circuit extraction
Zdroj:	Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97.
DOI:	10.1109/iscas.1997.621455
Popis:	Since the layout compaction problem is dual to the minimum cost flow problem, flow algorithms can be applicable to the layout compaction. In this paper, an existing flow algorithm is investigated in terms of the layout compaction, and a fast flow algorithm is devised on the basis of the primal-dual method. Experimental results show that the proposed algorithm is the fastest dedicatedly for the compaction problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c334236e6bce110d5aaa1eba3b7795b3 https://doi.org/10.1109/iscas.1997.621455 Zobrazit plný text záznamu