메뉴 건너뛰기




Volumn 1, Issue 1, 1983, Pages 21-38

Hierarchical channel router

Author keywords

Channel router; hierarchy; N * n log m time

Indexed keywords

ELECTRIC WIRING;

EID: 0020736321     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-9260(83)90004-4     Document Type: Article
Times cited : (28)

References (12)
  • 8
    • 0038399091 scopus 로고
    • Algorithms for integrated circuit layout: An analytic approach
    • MIT, Laboratory for Computer Science, Cambridge, MS
    • (1980) PhD thesis
    • Lapaugh1
  • 10
    • 0017468130 scopus 로고
    • Rectilinear Steiner trees: Efficient special case algorithms
    • (1977) Networks , vol.7 , pp. 37-58
    • Aho1    Garey2    Hwang3
  • 11
    • 84909545905 scopus 로고    scopus 로고
    • T.G. Szymanski, Dogleg channel routing is NP-complete, to appear.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.