Open Access Open Access  Restricted Access Subscription or Fee Access

The Graphic Application of Random Channel Specifications

Qionghua TanTan, Jinshan Xie, Zhenghua Xu


Channel routing is a key problem in the area of VLSI layout. Finding a minimum width solution of channel routing was proved to be NP-hard by Szyman-ski. In this paper, we come to a conclusion that the minimum parallel clique cover of CCG is equivalent to the optimal solution of 2-layer manhattan channel routing where vertical constrains are noncyclic and extra empty columns and doglegs are not allowed. The same is true for the minimum parallel stable set cover of MCCG. We also give a new heuristic algorithm based on the result to solve the problem of 2-layer manhattan channel routing. In general, comparing with the merging algorithm, our algorithm saves the storage space of about 50%.


Channel routing; Manhattan model; VLSI layout; Graph.

Full Text:


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.