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

Iterative algorithms for generating minimal cutsets in directed graphs

โœ Scribed by D. R. Shier; D. E. Whited

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
803 KB
Volume
16
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

In Favor of Conjugate Directions: a Gene
In Favor of Conjugate Directions: a Generalized Acceptable-point Algorithm for Function Minimization
โœ M.A. Townsend; G.E. Johnson ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

## A generalization of the conjugate directions minimization technique enables utilization of a coarse univariate subsearch to identify acceptable points (as opposed to a minimizing line search) and performs better than commonly-used conjugate directions algorithms. It performs comparably to and has

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
โœ J.X. Hao; J.B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum