default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Reliability Of Computer And Communication Networks 1989
- Fred Roberts, Frank Hwang, Clyde L. Monma:
Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 5, DIMACS/AMS 1991, ISBN 978-0-8218-6592-7 - Preface. Reliability Of Computer And Communication Networks 1989: v-
- Program. Reliability Of Computer And Communication Networks 1989: ix-
- List of Participants. Reliability Of Computer And Communication Networks 1989: xv-
- Gerald R. Ash:
Robust Desing of Dynamic Routing Networks. 1-32 - Daniel Bienstock:
Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey). 33-50 - Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
On Residual Connectedness Network Reliability. 51-60 - Richard H. Cardwell:
Survivable Fiber Network Design. 61-78 - Chiuh-Cheng Chyu:
Decomposable Probabilistic Influence Diagrams. 79-90 - Charles J. Colbourn, Eugene I. Litvak:
Bounding Network Parameters by Approximating Graphs. 91-104 - William H. Cunningham:
The Optimal Multiterminal Cut Problem. 105-120 - Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral Approaches to Network Survivability. 121-142 - Frank Kwang-Ming Hwang:
A Survey on Double Loop Networks. 143-152 - Nita M. Kini, Anup Kumar, Dharma P. Agrawal:
Quantitative Reliability Analysis of Redundant Multistage Interconnection Networks. 153-170 - Richard P. McLean, Douglas H. Blair:
An Axiomatic Characterization of the Reliability Polynomial. 171-182 - Dhiraj K. Pradhan:
Fault-Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties). 183-196 - András Prékopa, Endre Boros, Keh-Wei Lih:
The Use of Binomial Monments for Bounding Network Reliability. 197-212 - J. Scott Provan:
Boolean Decomposition Schemes and the Complexity of Reliability Computations. 213-228 - Cauligi S. Raghavendra, M. A. Sridhar:
On Dynamic Full Access in Multistage Interconnection Networks. 229-244 - Douglas R. Shier:
Algebraic Methods for Bounding Network Reliability. 245-259
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-08 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
