Optimally Reliable Graphs for Both Vertex and Edge Failures
From MaRDI portal
Publication:4289307
DOI10.1017/S0963548300000493zbMATH Open0799.90058MaRDI QIDQ4289307FDOQ4289307
Authors:
Publication date: 28 April 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)
Cites Work
- Synthesis of reliable networks - a survey
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On the existence of uniformly optimally reliable networks
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- On the design of reliable networks
- On the Invulnerability of the Regular Complete k-Partite Graphs
- On the construction of optimally reliable graphs
- Graphs with the smallest number of minimum cut sets
Cited In (14)
- Accessibility and reliability for connected bipartite graphs
- A nearly optimal oracle for avoiding failed vertices and edges
- On the construction of optimally reliable graphs
- Uniformly optimal graphs in some classes of graphs with node failures
- Sixty years of network reliability
- Trees with large numbers of subtrees
- Title not available (Why is that?)
- Optimally reliable graphs for both edge and vertex failures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Binary strings and reliability of path networks
- Title not available (Why is that?)
- On the split reliability of graphs
- Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
This page was built for publication: Optimally Reliable Graphs for Both Vertex and Edge Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289307)
