Network Reliability : Experiments with a Symbolic Algebra Environment Hardback
Part of the Discrete Mathematics and Its Applications series
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.
- Format: Hardback
- Pages: 240 pages, 150 equations; 54 Tables, black and white
- Publisher: Taylor & Francis Inc
- Publication Date: 16/06/1995
- Category: Communications engineering / telecommunications
- ISBN: 9780849339806