On the Heuristic Steiner Tree and Single-Layer Two-Terminal Nets Routing Algorithms for EDA
碩士 === 國立臺灣海洋大學 === 資訊工程學系 === 92 === A Steiner minimal tree for a set Z of vertices on X Architectures is a tree, which interconnects Z using horizontal, vertical and oblique segments of shortest possible total length. In this paper, Lou bases on the Areibi‘s concepts and Prim’s minimal spanning tr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89719301876561541563 |