Search for All MCs with Backtracking  
Author Shin-Guang Chen




Abstract Backtracking is famous in Computer Science area, but no one has applied that concept in solving this problem. Back-tracking has successfully been applied to the search of MPs, and by now, it is still the fastest method for searching MPs. This paper proposes a very efficient method to search for all MCs in a flow network in terms of backtracking. Some benchmarks from the best-known algorithms in the literature are examined and compared. The results show that the efficiency of the method is excellent.


Keywords Stochastic-flow networks, reliability, minimal cut, linked path structure, backtracking
    Article #:  1975
Proceedings of the 19th ISSAT International Conference on Reliability and Quality in Design
August 5-7, 2013 - Honolulu, Hawaii, U.S.A.