Fast reliability ranking of matchstick minimal networks

DOI10.1002/net.22064zbMath1528.90090arXiv1911.01153MaRDI QIDQ6065903

Vlad-Florin Drăgoi, Valeriu Beiu

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01153

zbMATH Keywords

reliability polynomialuniformly most reliableheaviside most reliableminimal two-terminal networkposet of compositions

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• The average reliability of a graph
• Some applications of algebra to combinatorics
• A decomposition theorem for partially ordered sets
• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• Uniformly-most reliable networks do not always exist
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Computational Complexity of Network Reliability Analysis: An Overview
• The Complexity of Enumeration and Reliability Problems
• On graphs with randomly deleted edges
• A proof of Boesch's conjecture
• Nonexistence of optimal graphs for all terminal reliability
• On uniformly most reliable two‐terminal graphs
• On a Conjecture of Andrica and Tomescu
• What is the probability of connecting two points?
• Reliable circuits using less reliable relays
• On the existence of uniformly optimally reliable networks