Indexed by：
Abstract：
Routing is a very important step in the automatic layout design of VLSI circuits. We often consider the routing for some special nets under the restrictions, such as equidistance and symmetry. When the symmetrical routing is needed, the routing is often finished by hand. The manual wiring can only solve the routing where layers and nets are less. The symmetrical routing problem is equivalent to finding a Steiner tree of the corresponding vertices for all of the pins in the valid connected graph. We put forward an algorithm for the symmetrical routing and provide a method and the theory based on graphs for the automation software of the symmetrical routing. © 2012 by IJAMAS, CESER Publications.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
International Journal of Applied Mathematics and Statistics
ISSN： 0973-1377
Year： 2012
Issue： 5
Volume： 29
Page： 90-100
0 . 3 0 0
JCR@2023
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 3
Affiliated Colleges：
