论文信息 - A New Algorithm to Determine All the Minimum Edge Sets of a System Graph - 字舞流文

A New Algorithm to Determine All the Minimum Edge Sets of a System Graph

This paper describes a new algorithm to determine all the minimum edge sets, of a given system graph, under which the graph becomes 1-distinguishable i.e., by placing suitable test points at those ...

Pradip K. Srimani | Bhabani P. Sinha | A. K. Choudhury

[1] A. K. Choudhury,et al. Some Studies on Connected Cover Term Matrices of Switching Functions , 1965 .

[2] Juhani Nieminen,et al. A New Method of Formulating a Minimum Edge Set , 1975, IEEE Transactions on Computers.

[3] 渡辺力,et al. R.A. Mapleton: Theory of Charge Exchange, Wiley-Interscience, New York, 1972, x+284ページ, 23.5×16cm, $19.95 , 1973 .

[4] W. Mayeda,et al. Distinguishability Criteria in Oriented Graphs and Their Application to Computer Diagnosis-I , 1969 .

[5] C. V. Ramamoorthy,et al. Analysis of Graphs by Connectivity Considerations , 1966, J. ACM.

[6] Patrick E. O'Neil,et al. A Fast Expected Time Algorithm for Boolean Matrix Multiplication and Transitive Closure , 1973, Inf. Control..

[7] S. R. Das,et al. An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation , 1971, IEEE Transactions on Computers.

[8] Insley B. Pyne,et al. The Reduction of Redundancy in Solving Prime Implicant Tables , 1962, IRE Trans. Electron. Comput..

[9] Oscar H. Ibarra,et al. Polynomially Complete Fault Detection Problems , 1975, IEEE Transactions on Computers.

[10] C. V. Ramamoorthy,et al. Computer Diagnosis Using the Blocking Gate Approach , 1971, IEEE Transactions on Computers.