Synopses & Reviews
This book develops combinatorial tools which are useful for reliability analysis, as demonstrated with a probabilistic network model. Basic results in combinatorial enumeration are reviewed, along with classical theorems on connectivity and cutsets. More developed analysis involves extremal set theory, matroid theory, and polyhedral combinatorics, among other themes. The presentation includes proofs or their outlines for most of the main theorems, with the aim of highlighting combinatorial ideas. Details of relevant work are presented wherever feasible. The work is intended for advanced mathematics students and computer science specialists.
Table of Contents
1. Preliminaries
2. Exact Algorithms
3. The Computational Complexity of Reliability Problems
4. Exact Algorithms for Restricted Classes
5. The Reliability Polynomial
6. Edge-Disjoint Subgraphs
7. Additive and Multiplicative Improvements
8. Combining the Bounds
9. The K-Cycle Bound
10. Computational Results