VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY

DOI10.17223/20710410/47/6zbMath1455.05072OpenAlexW3010896811MaRDI QIDQ5151436

D. A. Migov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm695

zbMATH Keywords

random graphnetwork reliabilitynetwork decompositionvertex cutedge cutfactoring methodprobabilistic connectivity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing diameter constrained reliability of a network with junction points
• Factorization of network reliability with perfect nodes. I: Introduction and statements
• Factorization of network reliability with perfect nodes. II: Connectivity matrix
• S-functions for graphs
• Partitions and network reliability
• Sixty years of network reliability
• Logical-probabilistic calculus: a tool for studying the reliability and safety of structurally complex systems
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Triconnected decomposition for computingK-terminal network reliability
• The Complexity of Enumeration and Reliability Problems
• Dividing a Graph into Triconnected Components
• Adaptive statistical algorithms in network reliability analysis
• Fault-tolerant system for organizing highperformance computing for solving data processing problems

This page was built for publication: VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY