Network Reliability: Experiments with a Symbolic Algebra Environment

1st Edition

Daryl D Harms, Miroslav Kraetzl, Charles J. Colbourn, Stanley J. Devitt

CRC Press
Published June 16, 1995
Reference - 240 Pages
ISBN 9780849339806 - CAT# 3980
Series: Discrete Mathematics and Its Applications

For Instructors Request Inspection Copy

USD$265.00

Add to Wish List
FREE Standard Shipping!

Summary

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.

Instructors

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title

Related Titles