REFERENCES
- W Mayeda, Graph Theory, John Wiley and Sons, New York, 1972.
- M Bellmore & P A Jenson, An implicit enumeration Scheme for proper cut generation, Technometrics, vol 12, pp 775–788, Nov 1970.
- J E Biegel, Determination of tiesets and cutsets for a system without feedback, IEEE Trans Reliability, vol R-26, pp 39–42
- G D M Pearson, Computer program for approximating the reliability characteristics of a cyclic directed graphs, IEEE Trans Reliability, vol R-26, pp 32–38, April 1977.
- S Arunkumar & S H Lee, Enumeration of all the minimal cutsets for a node pair in a graph, IEEE Trans Reliability, vol R-28, pp 51–55, April 1979.
- U Abel & R Bicker, Determination of all minimal cut-sets between a vertex pair in an undirected graph, IEEE Trans Reliability, vol R-31, pp 169–171, June 1982.
- G B Jasmon & O S Kai, A new technique in minimal path and cutset evaluation, IEEE Trans Reliability, vol R-34, pp 136–143, June 1985.
- G B Jasmon & K W Foong, A method for evaluating all the minimal cuts of a graph, IEEE Trans Reliability, vol R-36, pp pp 539–545, Dec 1987.
- S Hasanuddin Ahmad, Simple enumeration of minimal cutsets of acyclic directed graph, IEEE Trans Reliability, vol R-37, pp 484–487, Dec 1988.
- Mitchell O Locks, Recent developments in computing of system-reliability, IEEE Trans Reliability, vol R-34, pp 425–436, Dec 1985.
- Mitchell O Locks, Recurrsive disjoint products: A review of three algorithms, IEEE Trans Reliability, vol R-31, pp 33–35, Apr 1982.
- K K Aggarwal, K B Misra & J S Gupta, Reliability evaluation: A comparative study of different techniques, Microelectronics and Reliability, vol 14, pp 49–56, 1975.