𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Determining minimal cuts with a minimal number of arcs

✍ Scribed by Horst Hamacher

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
478 KB
Volume
12
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Saturated graphs with minimal number of
Saturated graphs with minimal number of edges
✍ L. KΓ‘szonyi; Zs. Tuza πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given a

Minimizing the number of tankers to meet
Minimizing the number of tankers to meet a fixed schedule
✍ G. B. Dantzig; D. R. Fulkerson πŸ“‚ Article πŸ“… 1954 πŸ› John Wiley and Sons 🌐 English βš– 290 KB

I 6 . 12 G . B . D a n t z i g and D. R . F u l k e r s o n The Hand C o r p o r a t i o n ## I It is shown that the problem of determining the minimum number of tankers required to meet a fixed schedule of transportation of Navy fuel oil can be made into a linear programming problem of the t r a

Optimal number of minimal repairs before
Optimal number of minimal repairs before replacement of a system subject to shocks
✍ Shey-Huei Sheu; William S. Griffith πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 669 KB

A system is subject to shocks that amve according to a nonhomogeneous Poisson process. As shocks occur a system has two types of failures. Type 1 failure (minor failure) is removed by a minimal repair, whereas type 2 failure (catastrophic failure) is removed by replacement. The probability of a type