메뉴 건너뛰기




Volumn C-23, Issue 1, 1974, Pages 86-88

Characterization of Connection Assignment of Diagnosable Systems

Author keywords

Automatic diagnosis; digital systems; graph models; multiple faults

Indexed keywords


EID: 84947657515     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1974.223782     Document Type: Article
Times cited : (334)

References (3)
  • 1
    • 84938017623 scopus 로고
    • On the connection assignment problem of diagnosable systems
    • Dec.
    • F. P. Preparata, G. Metze, and R. T. Chien, “On the connection assignment problem of diagnosable systems,” IEEE Trans. Electron. Comput., vol. EC-16, pp. 848–854, Dec. 1967.
    • (1967) IEEE Trans. Electron. Comput. , vol.EC-16 , pp. 848-854
    • Preparata, F.P.1    Metze, G.2    Chien, R.T.3
  • 2
    • 0003780715 scopus 로고
    • Reading, Mass.: Addison-Wesley
    • F. Harary, Graph Theory. Reading, Mass.: Addison-Wesley, 1969.
    • (1969) Graph Theory
    • Harary, F.1
  • 3
    • 33749411118 scopus 로고
    • Methods for investigating connectivity for large graphs
    • (Corresp.), May
    • D. J. Kleitman “Methods for investigating connectivity for large graphs,” IEEE Trans. Circuit Theory (Corresp.), vol. CT-16, pp. 232–233, May 1969.
    • (1969) IEEE Trans. Circuit Theory , vol.CT-16 , pp. 232-233
    • Kleitman, D.J.1


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