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: Row By Row Bookshop, Sugar Grove, NC, U.S.A.
Hardcover. Condition: Good. Dust Jacket Condition: No Dust Jacket. First Edition. An ex-library copy in original pictorial hard covers. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book. Seller Inventory # 065807