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

Node partition formula for directed graph reliability

โœ Scribed by J. A. Buzacott

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
625 KB
Volume
17
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali