Open Access Open Access  Restricted Access Subscription or Fee Access

A Polynomial time Algorithm for 2-layer Channel Routing Problem

Xianya Geng


Channel routing in the 2-layer Manhattan model is one of the most investigated problems in VLSI design. Dávid Szeszlér [Szeszlér D., A New Algorithm for 2-layer, Manhattan Channel Routing, Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (2003), 179–185] gave a complete characterization of all specifications that are solvable and present a linear time algorithm to solve these specifications with a width at most constant times the length of the problem. In this paper an efficient graph theoretic algorithm for a particular 2-layer Manhattan channel routing problem has been presented, we give a new polynomial time algorithm to solve these specifications with a width better than the result of Dávid Szeszlér.


Channel routing, Manhattan model, VLSI

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.