Uniformly optimally reliable graphs: A survey
From MaRDI portal
Publication:6085885
DOI10.1002/net.22085OpenAlexW4200440648MaRDI QIDQ6085885
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/20.500.12381/699
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (05C99)
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- The complexity of computing the permanent
- Measuring and optimizing system reliability: a stochastic programming approach
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Undirected simple connected graphs with minimum number of spanning trees
- Uniformly optimal graphs in some classes of graphs with node failures
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- 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
- Topological optimization of reliable networks under dependent failures
- On the construction of most reliable networks
- Network reliability in Hamiltonian graphs
- Nonexistence of uniformly most reliable two-terminal graphs
- On the reliability roots of simplicial complexes and matroids
- Classes of uniformly most reliable graphs for all-terminal reliability
- On family of graphs with minimum number of spanning trees
- SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
- COUNTEREXAMPLES TO CONJECTURES FOR UNIFORMLY OPTIMALLY RELIABLE GRAPHS
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- A survey of some network reliability analysis and synthesis results
- The Complexity of the Residual Node Connectedness Reliability Problem
- On the construction of optimally reliable graphs
- A Survey of Network Reliability and Domination Theory
- Uniformly-most reliable networks do not always exist
- Some Alternate Characterizations of Reliability Domination
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Rare Event Simulation using Monte Carlo Methods
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Computational Complexity of Network Reliability Analysis: An Overview
- The Complexity of Enumeration and Reliability Problems
- On graphs with randomly deleted edges
- Least reliable networks and the reliability domination
- 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
- Computing the Reliability of Complex Networks
- On reliability of graphs with node failures
- A proof of Boesch's conjecture
- Maximizing spanning trees in almost complete graphs
- The structure of max ?-minm?+1 graphs used in the design of reliable networks
- Uniformly optimally reliable graphs
- Nonexistence of optimal graphs for all terminal reliability
- On uniformly most reliable two‐terminal graphs
- Maximizing the number of spanning trees of networks based on cycle basis representation
- Network reliability and the factoring theorem
- A survey of efficient reliability computation using disjoint products approach
- Reducibility among Combinatorial Problems
- Network transformations and bounding network reliability
- On the Invulnerability of the Regular Complete k-Partite Graphs
- Network reliability analysis: Part I
- The complexity of theorem-proving procedures
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- Reliable circuits using less reliable relays
- On the existence of uniformly optimally reliable networks
This page was built for publication: Uniformly optimally reliable graphs: A survey
