A Time and Space Efficient Net Extractor
Surendra Nahar, Sartaj K. Sahni · Design Automation Conference · 1986
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.