1995 . Mathematics, Combinatorics, Applied, Technology & Engineering, Electrical . Daryl D Harms, Miroslav Kraetzl, Charles J. Colbourn, Stanley J. Devitt
Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It describes, in algorithmic outlines, efficient techniques for reliability bounds and discusses the implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are strongly supported by sound theoretical development.
0849339804 (ISBN13: 9780849339806)
No reviews for this book yet