A Graph Theoretic Approach for Manhattan Channel Routing Problem with General Case
Channel routing in the 2-layer Manhattan model is one of the most investigated problems in VLSI design. Geng gave a algorithm for 2-layer Manhattan channel routing problem with bipartite and vertical constraint graph doesn’t have directed cycles. In this paper, we consider 2-layer Manhattan channel routing problem with bipartite and vertical constraint graph has directed cycles, an efficient graph theoretic algorithm for this case is present. Then we consider general 2-layer Manhattan channel routing problem, we also give an efficient algorithm.
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. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.