Optimally Reliable Graphs for Both Vertex and Edge Failures
From MaRDI portal
Publication:4289307
DOI10.1017/S0963548300000493zbMath0799.90058MaRDI QIDQ4289307
No author found.
Publication date: 28 April 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
90B15: Stochastic network models in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
Cites Work
- On the construction of optimally reliable graphs
- On the design of reliable networks
- Graphs with the smallest number of minimum cut sets
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Synthesis of reliable networks - a survey
- On the Invulnerability of the Regular Complete k-Partite Graphs
- On the existence of uniformly optimally reliable networks