𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tree decomposition algorithm for large networks

✍ Scribed by W. J. Blewett; T. C. Hu


Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
296 KB
Volume
7
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A decomposition algorithm for network re
✍ 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

Segregated targeting for multiple resour
✍ Santanu Bandyopadhyay; Gopal Chandra Sahu; Dominic Chwan Yee Foo; Raymond R. Tan πŸ“‚ Article πŸ“… 2009 πŸ› American Institute of Chemical Engineers 🌐 English βš– 396 KB

## Abstract A generalized decomposition technique is presented for determining optimal resource usage in segregated targeting problems with single quality index (e.g., concentration, temperature, etc.) through pinch analysis. The latter problems are concerned with determining minimal resource requi

Faster exact algorithms for steiner tree
✍ Marshall Bern πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.

A recursive decomposition algorithm for
✍ 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