IEICE TRANSACTIONS on transactions
An Approach for Topological Routing by W-Graph
Summary :
A new approach for topological routing is proposed by W-graph. We employ a W-graph Gw(V, E, W) for indicating all nets which will be assigned to two-layer, where V is a set of all terminals, E is a set of edges corresponding to two-terminal nets and W is a set of wild components corresponding to multi-terminal nets. Such that the topological routing problem can be considered as: Given a circle H containing V in the sequence corresponding to terminals on the boundary of routing region, then drawing H
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.11 pp.1785-1788
- Publication Date
- 1990/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Issue on 1990 Autumn Natl. Conv. IEICE)
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hua-An ZHAO, Wataru MAYEDA, "An Approach for Topological Routing by W-Graph" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 11, pp. 1785-1788, November 1990, doi: .
Abstract: A new approach for topological routing is proposed by W-graph. We employ a W-graph Gw(V, E, W) for indicating all nets which will be assigned to two-layer, where V is a set of all terminals, E is a set of edges corresponding to two-terminal nets and W is a set of wild components corresponding to multi-terminal nets. Such that the topological routing problem can be considered as: Given a circle H containing V in the sequence corresponding to terminals on the boundary of routing region, then drawing H
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_11_1785/_p
Copy
@ARTICLE{e73-e_11_1785,
author={Hua-An ZHAO, Wataru MAYEDA, },
journal={IEICE TRANSACTIONS on transactions},
title={An Approach for Topological Routing by W-Graph},
year={1990},
volume={E73-E},
number={11},
pages={1785-1788},
abstract={A new approach for topological routing is proposed by W-graph. We employ a W-graph Gw(V, E, W) for indicating all nets which will be assigned to two-layer, where V is a set of all terminals, E is a set of edges corresponding to two-terminal nets and W is a set of wild components corresponding to multi-terminal nets. Such that the topological routing problem can be considered as: Given a circle H containing V in the sequence corresponding to terminals on the boundary of routing region, then drawing H
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - An Approach for Topological Routing by W-Graph
T2 - IEICE TRANSACTIONS on transactions
SP - 1785
EP - 1788
AU - Hua-An ZHAO
AU - Wataru MAYEDA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1990
AB - A new approach for topological routing is proposed by W-graph. We employ a W-graph Gw(V, E, W) for indicating all nets which will be assigned to two-layer, where V is a set of all terminals, E is a set of edges corresponding to two-terminal nets and W is a set of wild components corresponding to multi-terminal nets. Such that the topological routing problem can be considered as: Given a circle H containing V in the sequence corresponding to terminals on the boundary of routing region, then drawing H
ER -
English
