Title :
A Time and Space Efficient Net Extractor
Author :
Nahar, Surendra ; Sahni, Sartaj
Author_Institution :
University of Minnesota
Abstract :
We develop an efficient algorithm for net extraction. This algorithm is able to efficiently handle very large layouts even when memory is limited. This is done by effectively using disk storage. The algorithm has been programmed in Fortran and is superior to other existing net extractors.
Keywords :
Net extraction; time and space complexity; Application software; Computational geometry; Computer architecture; Documentation; Fabrication; Pins; Shape; Software systems; System testing; Very large scale integration; Net extraction; time and space complexity;
Conference_Titel :
Design Automation, 1986. 23rd Conference on
Print_ISBN :
0-8186-0702-5
DOI :
10.1109/DAC.1986.1586122
