𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition algorithms for locating minimal cuts in a network

✍ Scribed by John J. Jarvis; Suleyman Tufekci

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
679 KB
Volume
22
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithm for finding minimal cut sets i
Algorithm for finding minimal cut sets in a fault tree
✍ Ladislav Rosenberg πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit

A decomposition algorithm for network re
A decomposition algorithm for network reliability analysis
✍ A. W. Shogan πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 945 KB

## Abstract Consider a directed, source‐sink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source