Abstract
It is shown that the problem of via minimization in VLSI routing with movable terminals can be solved in O(n log n) time by using the algorithm finding a maximum independent set in a permutation graph. It is also shown that the nets of an example are routed with fewer tracks and vias. Therefore, the number of vias is reduced by using a correct algorithm rather than an algorithm finding a length of largest up-sequence. >
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.
