Uniformly optimally reliable graphs: A survey (Q6085885): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/net.22085 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Survey of Network Reliability and Domination Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of uniformly most reliable graphs for all-terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: COUNTEREXAMPLES TO CONJECTURES FOR UNIFORMLY OPTIMALLY RELIABLE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological optimization of reliable networks under dependent failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in the analysis and design of probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformly most reliable two‐terminal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of some network reliability analysis and synthesis results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unreliability polynomials and graph connectivity in reliable network synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Invulnerability of the Regular Complete <i>k</i>-Partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of uniformly optimally reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least reliable networks and the reliability domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Alternate Characterizations of Reliability Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected simple connected graphs with minimum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On family of graphs with minimum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reliability roots of simplicial complexes and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network transformations and bounding network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of optimal graphs for all terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of most reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing spanning trees in almost complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability of graphs with node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly optimally reliable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with randomly deleted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability in Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly-most reliable networks do not always exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of graphs with maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for the characterization of graphs with a maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring and optimizing system reliability: a stochastic programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of efficient reliability computation using disjoint products approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Reliability of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rare Event Simulation using Monte Carlo Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability and the factoring theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliability-improving graph transformation with applications to network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of optimally reliable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Residual Node Connectedness Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees of networks based on cycle basis representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability analysis: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Boesch's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of max ?-minm?+1 graphs used in the design of reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of uniformly most reliable two-terminal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly optimal graphs in some classes of graphs with node failures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.22085 / rank
 
Normal rank

Latest revision as of 19:17, 30 December 2024

scientific article; zbMATH DE number 7776618
Language Label Description Also known as
English
Uniformly optimally reliable graphs: A survey
scientific article; zbMATH DE number 7776618

    Statements

    Uniformly optimally reliable graphs: A survey (English)
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    network reliability
    0 references
    most reliable graph
    0 references
    reliability polynomial
    0 references
    uniformly optimally reliable graph
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references