메뉴 건너뛰기




Volumn 4, Issue 1, 1996, Pages 1-10

A Multi-Terminal Net Router for Field-Programmable Gate Arrays

Author keywords

Field Programmable Gate Arrays; Routing; VLSI

Indexed keywords

APPROXIMATION THEORY; LOGIC GATES; PROBABILITY; TREES (MATHEMATICS); VLSI CIRCUITS;

EID: 0029734965     PISSN: 1065514X     EISSN: None     Source Type: Journal    
DOI: 10.1155/1996/79127     Document Type: Article
Times cited : (2)

References (9)
  • 5
    • 0016891335 scopus 로고
    • On Steiner Minimal Trees with Rectilinear Distance
    • F. K. Hwang. On Steiner Minimal Trees with Rectilinear Distance. SIAM Journal on Applied Mathematics, 30:104–114, 1976.
    • (1976) SIAM Journal on Applied Mathematics , vol.30 , pp. 104-114
    • Hwang., F.K.1
  • 6
    • 70350674995 scopus 로고
    • On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem
    • J.B. Kruskal. On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem. Proceedings of American Mathematical Society, 7:48–50, 1956.
    • (1956) Proceedings of American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 7
    • 0025507460 scopus 로고
    • Parallel global routing for standard cells
    • October
    • J. Rose. Parallel global routing for standard cells. IEEE Transactions on Computer-Aided Design, 9:1085–1095, October 1990.
    • (1990) IEEE Transactions on Computer-Aided Design , vol.9 , pp. 1085-1095
    • Rose, J.1


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