This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Method of Formulating a Minimum Edge Set
October 1975 (vol. 24 no. 10)
pp. 1015-1018
J. Nieminen, Department of Technical Sciences, Finnish Academy
Mayeda and Ramamoorthy have reduced the problem of finding a minimum number of test points which detect an improperly operating functional element of a single entry-single exit (SEC) system graph, to the problem of finding a minimum number of edges under which this system graph is 1 distinguishable. This correspondence shows that the determilnation of the minimum edge set is equivalent to the determination of a minimum covering of a certain matrix M (S) of zeros and ones. A way of finding the matrix M (S) is proposed.
Index Terms:
Directed graphs, fault location, minimum coverng, minimum number of test points, one distinguishability.
Citation:
J. Nieminen, "A New Method of Formulating a Minimum Edge Set," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1015-1018, Oct. 1975, doi:10.1109/T-C.1975.224115
Usage of this product signifies your acceptance of the Terms of Use.