메뉴 건너뛰기




Volumn , Issue , 2003, Pages 60-64

Optimal fault-tolerant linear arrays

Author keywords

Expander; Fault Tolerant Graph; Linear Array; Magnifier

Indexed keywords

GRAPH THEORY; HAMILTONIANS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

EID: 0038717604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777422.777423     Document Type: Conference Paper
Times cited : (11)

References (12)
  • 1
    • 38249028223 scopus 로고
    • Explicit construction of linear sized tolerant networks
    • ALON, N., AND CHUNG, F. Explicit construction of linear sized tolerant networks. Discrete Math. 72 (1988), 15-19.
    • (1988) Discrete Math. , vol.72 , pp. 15-19
    • Alon, N.1    Chung, F.2
  • 2
    • 0006103433 scopus 로고    scopus 로고
    • Fault-tolerant meshes with small degree
    • BRUCK, J., CYPHER, R., AND HO, C. Fault-tolerant meshes with small degree. SIAM Journal on Computing 26 (1997), 1764-1784.
    • (1997) SIAM Journal on Computing , vol.26 , pp. 1764-1784
    • Bruck, J.1    Cypher, R.2    Ho, C.3
  • 5
    • 0000871697 scopus 로고
    • Explicit constructions of linear-sized superconcentrators
    • GABBER, O., AND GALIL, Z. Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences 22 (1981), 407-420.
    • (1981) Journal of Computer and System Sciences , vol.22 , pp. 407-420
    • Gabber, O.1    Galil, Z.2
  • 6
    • 0039056009 scopus 로고    scopus 로고
    • Node fault tolerance in graphs
    • HARARY, F., AND HAYES, J. Node fault tolerance in graphs. Networks 27 (1996), 19-23.
    • (1996) Networks , vol.27 , pp. 19-23
    • Harary, F.1    Hayes, J.2
  • 7
    • 0016992757 scopus 로고
    • A graph model for fault-tolerant computing systems
    • HAYES, J. A graph model for fault-tolerant computing systems. IEEE Trans. on Comput. C-25 (1976), 875-883.
    • (1976) IEEE Trans. on Comput. , vol.C-25 , pp. 875-883
    • Hayes, J.1
  • 8
    • 84986511249 scopus 로고
    • Minimum k-hamiltonian graphs, II
    • PAOLI, M., WONG, W., AND WONG, C. Minimum k-hamiltonian graphs, II. J. Graph Theory 10 (1986), 79-95.
    • (1986) J. Graph Theory , vol.10 , pp. 79-95
    • Paoli, M.1    Wong, W.2    Wong, C.3
  • 10
    • 84986522826 scopus 로고
    • Minimum k-hamiltonian graphs
    • WONG, W., AND WONG, C. Minimum k-hamiltonian graphs. J. Graph Theory 8 (1984), 155-165.
    • (1984) J. Graph Theory , vol.8 , pp. 155-165
    • Wong, W.1    Wong, C.2
  • 12
    • 0036565808 scopus 로고    scopus 로고
    • Fault-tolerant meshes with small degree
    • May
    • ZHANG, L. Fault-tolerant meshes with small degree. IEEE Transactions on Computers 51, 5 (May 2002), 553-560.
    • (2002) IEEE Transactions on Computers , vol.51 , Issue.5 , pp. 553-560
    • Zhang, L.1


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