메뉴 건너뛰기




Volumn 46, Issue 4, 1998, Pages 454-455

Choosing the best log-4(n, m, p) strictly nonblocking networks

Author keywords

Banyan network; Clos network; Strictly nonblocking network

Indexed keywords

GRAPH THEORY; NUMBER THEORY; NUMERICAL METHODS; THEOREM PROVING;

EID: 0032048180     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.664299     Document Type: Article
Times cited : (27)

References (2)


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