A New Technique in Minimal Path and Cutset Evaluation

This paper presents a new technique for deducing the minimal paths and cutsets of a general network. A powerful concept of reducing the total number of minimal paths to its basic minimal paths is introduced. This concept reduces the computational time and required storage in deducing the minimal cut...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on reliability 1985-06, Vol.R-34 (2), p.136-143
Main Authors: Jasmon, G. B., Kai, O. S.
Format: Article
Language:English
Subjects:
Algorithm
Applied sciences
Computer network reliability
Computer program
Cutset
Exact sciences and technology
Microcomputers
Network
Operational research and scientific management
Operational research. Management science
Path
Power system reliability
Reliability theory
Reliability theory. Replacement problems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a new technique for deducing the minimal paths and cutsets of a general network. A powerful concept of reducing the total number of minimal paths to its basic minimal paths is introduced. This concept reduces the computational time and required storage in deducing the minimal cutsets. A new technique for evaluating minimal cutsets has been adopted. Examples demonstrate the power of the technique in reducing the computational requirements as compared to the conventional method, and show that the task for analysing large systems now becomes trival.
ISSN:0018-9529
1558-1721
DOI:10.1109/TR.1985.5221974