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.
"synopsis" may belong to another edition of this title.
Harms\, Daryl D; Kraetzl\, Miroslav; Colbourn\, Charles J.; Devitt\, Stanley J.
"About this title" may belong to another edition of this title.
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Seller Inventory # OTV.0849339804.G