DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1991; 259 pp; hardcover Volume: 5 ISBN10: 0821865927 ISBN13: 9780821865927 List Price: US$57 Member Price: US$45.60 Order Code: DIMACS/5
 Reliability problems arise with increasing frequency as our systems of telecommunications, information transmission, transportation, and distribution become more and more complex. In December 1989 at DIMACS at Rutgers University, a Workshop on Reliability of Computer and Communication Networks was held to examine the discrete mathematical methods relevant to these problems. There were nearly ninety participants, including theoretical mathematicians, computer scientists, and electrical engineers from academia and industry, as well as network practitioners, engineers, and reliability planners from leading companies involved in the use of computer and communications networks. This volume, published jointly with the Association for Computing Machinery, contains the proceedings from this Workshop. The aim of the Workshop was to identify the latest trends and important open problems, as well as to survey potential practical applications. The Workshop explored questions of computation of reliability of existing systems and of creating new designs to insure high reliability, in addition to the closely related notion of survivability. Redundancy, single stage and multistage networks, interconnected networks, and fault tolerance were also covered. The Workshop emphasized practical applications, with many invited speakers from a variety of companies which are dealing with practical network reliability problems. The success of the Workshop in fostering many new interactions among researchers and practitioners is reflected in the proceedings, which provide an exciting look at some of the major advances at the forefront of this important field of research. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Table of Contents  G. R. Ash  Robust design of dynamic routing networks
 D. Bienstock  Graph searching, pathwidth, treewidth and related problems (A survey)
 F. Boesch, A. Satyanarayana, and C. Suffel  On residual connectedness network reliability
 R. H. Cardwell  Survivable fiber network design
 C. C. Chyu  Decomposable probabilistic influence diagrams
 C. J. Colbourn and E. I. Litvak  Bounding network parameters by approximating graphs
 W. H. Cunningham  The optimal multiterminal cut problem
 M. Grötschel, C. Monma, and M. Stoer  Polyhedral approaches to network survivability
 F. K. Hwang  A survey on double loop networks
 N. M. Kini, A. Kumar, and D. P. Agrawal  Quantitative reliability analysis of redundant multistage interconnection networks
 R. P. McLean and D. H. Blair  An axiomatic characterization of the reliability polynomial
 D. K. Pradhan  Faulttolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)
 A. Prékopa, E. Boros, and K.W. Lih  The use of binomial moments for bounding network reliability
 J. S. Provan  Boolean decomposition schemes and the complexity of reliability computations
 C. S. Raghavendra and M. A. Sridhar  On dynamic full access in multistage interconnection networks
 D. R. Shier  Algebraic methods for bounding network reliability
