AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Reliability of Computer and Communication Networks
About this Title
Fred Stephen Roberts, Frank K. Hwang and Clyde L. Monma, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1991; Volume 5
ISBNs: 978-0-8218-6592-7 (print); 978-1-4704-3963-7 (online)
DOI: https://doi.org/10.1090/dimacs/005
MathSciNet review: MR1119137
MSC: Primary 68-06; Secondary 90-06
Table of Contents
Front/Back Matter
Chapters
- Robust design of dynamic routing networks
- Graph searching, path-width, tree-width and related problems (A survey)
- On residual connectedness network reliability
- Survivable fiber network design
- Decomposable probabilistic influence diagrams
- Bounding network parameters by approximating graphs
- The optimal multiterminal cut problem
- Polyhedral approaches to network survivability
- A survey on double loop networks
- Quantitative reliability analysis of redundant multistage interconnection networks
- An axiomatic characterization of the reliability polynomial
- Fault-tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)
- The use of binomial moments for bounding network reliability
- Boolean decomposition schemes and the complexity of reliability computations
- On dynamic full access in multistage interconnection networks
- Algebraic methods for bounding network reliability