Abstract is missing.
- List of Participants
- Program
- Preface
- Robust Desing of Dynamic Routing NetworksGerald R. Ash. 1-32
- Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey)Daniel Bienstock. 33-50
- On Residual Connectedness Network ReliabilityFrancis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel. 51-60
- Survivable Fiber Network DesignRichard H. Cardwell. 61-78
- Decomposable Probabilistic Influence DiagramsChiuh-Cheng Chyu. 79-90
- Bounding Network Parameters by Approximating GraphsCharles J. Colbourn, Eugene I. Litvak. 91-104
- The Optimal Multiterminal Cut ProblemWilliam H. Cunningham. 105-120
- Polyhedral Approaches to Network SurvivabilityMartin Grötschel, Clyde L. Monma, Mechthild Stoer. 121-142
- A Survey on Double Loop NetworksFrank Kwang-Ming Hwang. 143-152
- Quantitative Reliability Analysis of Redundant Multistage Interconnection NetworksNita M. Kini, Anup Kumar, Dharma P. Agrawal. 153-170
- An Axiomatic Characterization of the Reliability PolynomialRichard P. McLean, Douglas H. Blair. 171-182
- Fault-Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties)Dhiraj K. Pradhan. 183-196
- The Use of Binomial Monments for Bounding Network ReliabilityAndrás Prékopa, Endre Boros, Keh-Wei Lih. 197-212
- Boolean Decomposition Schemes and the Complexity of Reliability ComputationsJ. Scott Provan. 213-228
- On Dynamic Full Access in Multistage Interconnection NetworksCauligi S. Raghavendra, M. A. Sridhar. 229-244
- Algebraic Methods for Bounding Network ReliabilityDouglas R. Shier. 245