Abstract
In this paper the problem of the generation of all elements of a system of sets is investigated and a backtrack algorithm (Al) is given solving this problem.The algorithm is applied to combinatorial problems of reliability: A t-graph is interpreted as a binary coherent system S and the system function of S is represented as the sum of Boolean orthogonal products. This approach is a simple and efficient alternative to a method suggested by Satyanarayana and N. Hagstbom [9]. A directed p-graph is also interpreted as a binary coherent system S and both the minimal cuts of S and the cocycles of G are determined.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
