An Efficient Graph Theoretic Algorithm for Channel Routing in VLSI Design with Given Constraint Graph
Authors:
- 16 April 2024
- book chapter
- Published by Springer Nature
- p. 339-344
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some polynomially solvable subcases of the detailed routing problem in VLSI designDiscrete Applied Mathematics, 2001
- Channel routing of multiterminal netsJournal of the ACM, 1994
- A robust channel routerIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Dogleg Channel Routing is NP-CompleteIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- General channel-routing algorithmIEE Proceedings G (Electronic Circuits and Systems), 1983
- An approximation algorithm for manhattan routing1983