๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A recursive algorithm for directed-graph reliability

โœ Scribed by J. A. Buzacott

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
268 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A recursive decomposition algorithm for
A recursive decomposition algorithm for network seismic reliability evaluation
โœ Jie Li; Jun He ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 181 KB

## Abstract A new probabilistic analytical approach to evaluate seismic system reliability of large lifeline systems is presented in this paper. The algorithm takes the shortest path from the source to the terminal of a node weight or edge weight network as decomposition policy, using the Boolean l

A recursive algorithm for a summed multi
A recursive algorithm for a summed multinomial density function
โœ Raymond K. Fink; Herbert Moskowitz ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 446 KB

## Abstract An algorithm for calculating the probabilities of a summed multinomial density function which is recursive with __n__ (the number of trials) is presented. Having application in inspector error models for auditing and quality control problems with Cartesian product structures, the algori

A Distributed Algorithm for GSPN Reachab
A Distributed Algorithm for GSPN Reachability Graph Generation
โœ S Caselli; G Conte; P Marenzoni ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 318 KB

The applicability of generalized stochastic Petri nets (GSPNs) and other high-level modeling formalisms to real systems is often constrained by the explosion in the size of the underlying state-space representation. This paper describes a distributed program taking advantage of the large amount of m

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
โœ Hillel Gazit; John H Reif ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph ลฝ ลฝ 2 . 1 q โ‘€ which can be computed by known algorithms in O log n time with