Find the Set of Minimal Cuts of a Transistor Network
Original Publication Date: 1996-Jul-01
Included in the Prior Art Database: 2005-Mar-31
Algorithms have been proposed for the minimal cut set problem, based on the search of connected components. Further improvement is achieved by employing an efficient pruning strategy. They may be applied to the early mode timing analysis.