Open Access
Subscription or Fee Access
The Application of Vertex-disjoint Paths in VLSI
Abstract
Crosstalk affects the circuit performance more and more significantly in very deep submicron(VDSM) technology. It is necessary to reduce crosstalk in the actual routing process. The crosstalk minimization problem for a set of parallel
wires is transformed into the vertex-disjoint paths problem with a constraint. We give a heuristic algorithm for the crosstalk minimization problem of a set of parallel wires and prove that it is impossible to ¯nd the better solution
by adding any k edges and deleting at most 2 edges for the vertex-disjoint paths obtained from the algorithm. In general, comparing with the bi-weight algorithm which is given by Wong and Shao, our algorithm saves the storage space of about fifty percent. We also give some bounds of edges and some algorithms of the vertex-disjoint paths based on an ear decomposition.
Keywords
Refbacks
- 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.