Abstract
A depth-first search (DFS) algorithm requires much less memory than breadth-first search (BFS) one. However, the former doesn’t guarantee to find the shortest path in the VLSI (Very Large Integration Circuits) wire routing when the latter does. To remedy the shortcoming of DFS, this paper attempts to improve the DFS algorithm for VLSI wire routing by introducing a method of pruning and iterative deepening. This method guarantees to find all of the existing shortest paths with the same length in the VLSI wire routing to provide the wire routing designers more options for optimal designs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
