Optimally Reliable Graphs for Both Vertex and Edge Failures
From MaRDI portal
Publication:4289307
Recommendations
Cites work
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Graphs with the smallest number of minimum cut sets
- On the Invulnerability of the Regular Complete k-Partite Graphs
- On the construction of optimally reliable graphs
- On the design of reliable networks
- On the existence of uniformly optimally reliable networks
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Synthesis of reliable networks - a survey
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
- scientific article; zbMATH DE number 3884207 (Why is no real title available?)
- Optimally reliable graphs for both edge and vertex failures
- scientific article; zbMATH DE number 6945770 (Why is no real title available?)
- scientific article; zbMATH DE number 3880759 (Why is no real title available?)
- Binary strings and reliability of path networks
- scientific article; zbMATH DE number 4102997 (Why is no real title available?)
- 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)
