A survey of some network reliability analysis and synthesis results
From MaRDI portal
Publication:3057110
DOI10.1002/net.20300zbMath1200.90057OpenAlexW4238426377MaRDI QIDQ3057110
F. T. Boesch, Charles L. Suffel, A. Satyanarayana
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20300
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (19)
Toughness of the corona of two graphs ⋮ Network Elicitation in Adversarial Environment ⋮ Component importance measures for multi-industry vulnerability of a freight transportation network ⋮ New method for counting the number of spanning trees in a two-tree network ⋮ Complexity of graphs generated by wheel graph and their asymptotic limits ⋮ On maximum graphs in Tutte polynomial posets ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ The number of spanning trees in the composition graphs ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ The \(k\)-diameter component edge connectivity parameter ⋮ A scoring mechanism for the rank aggregation of network robustness ⋮ Number of spanning trees in the sequence of some graphs ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ The complexity of some classes of pyramid graphs created from a gear graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing residual connectedness reliability for restricted networks
- On computing a conditional edge-connectivity of a graph
- Chromatic polynomials and network reliability
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- A large class of maximally tough graphs
- On a kind of restricted edge connectivity of graphs
- A new technique for the characterization of graphs with a maximum number of spanning trees
- On the characterization of graphs with maximum number of spanning trees
- A certain polynomial of a graph and graphs with an extremal number of trees
- Toughness in graphs -- a survey
- Computing 2-terminal reliability for radio-broadcast networks
- The Complexity of the Residual Node Connectedness Reliability Problem
- A Survey of Network Reliability and Domination Theory
- Uniformly-most reliable networks do not always exist
- Some Alternate Characterizations of Reliability Domination
- Synthesis of reliable networks - a survey
- Efficient algorithms for reliability analysis of planar networks - a survey
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- Domination theory and the crapo β-invariant
- The Complexity of Enumeration and Reliability Problems
- A Unified Formula for Analysis of Some Network Reliability Problems
- On graphs with randomly deleted edges
- A reliability-improving graph transformation with applications to network reliability
- Maximizing the number of spanning trees in a graph with n nodes and m edges
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- A proof of Boesch's conjecture
- Maximizing spanning trees in almost complete graphs
- A logical expansion in mathematics
- Uniformly optimally reliable graphs
- Network reliability and the factoring theorem
- Edmonds polytopes and weakly hamiltonian graphs
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- On the existence of uniformly optimally reliable networks
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: A survey of some network reliability analysis and synthesis results
