Rapid Evaluation Of Minimal Cutsets Using Basic Minimal Paths
Jasmon Ghauth, and Loh, K.P. (1986) Rapid Evaluation Of Minimal Cutsets Using Basic Minimal Paths. Malaysian Journal of Computer Science, 2 . pp. 1-8. ISSN 0127-9084
Full text not available from this repository.
University of Malaya
The paper shows how the basic minimal paths of a network can be used instead of the mini-mal paths to obtain the minimal cutsets of a network. Since the number of basic minimal paths is small compared to the number of minimal paths, it is shown that large networks can easily be analyzed now which was not possible before. Examples are given to demons-trate this powerful technique.
|Additional Information:||This note was added by the search_and_modify.pl script.|
|Subjects:||Q Science, Computer Science|
Repository Staff Only: item control page