Complexity of network reliability computations
From MaRDI portal
Publication:3887194
DOI10.1002/net.3230100206zbMath0443.90038OpenAlexW2029478301WikidataQ126263582 ScholiaQ126263582MaRDI QIDQ3887194
Publication date: 1980
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230100206
computational complexityNP-hard problemsdirected networksnode failuresundirected networksnetwork reliability measures
Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
Computing optimal assignments for residual network reliability, Edge-packings of graphs and network reliability, Bounds for coherent reliability structures, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, On super restricted edge connectivity of half vertex transitive graphs, Finding the probability of infection in an SIR network is NP-hard, Algebraic Methods Applied to Network Reliability Problems, On the reliability estimation of stochastic binary systems, Counting almost minimum cutsets with reliability applications, Network reliability: Heading out on the highway, Unnamed Item, On network reliability evaluation by Monte Carlo method using high-performance computing, On super connectivity of Cartesian product graphs, A factoring approach for the stochastic shortest path problem, Nonexistence of uniformly most reliable two-terminal graphs, Restricted connectivity for some interconnection networks, An algorithm to compute the all-terminal reliability measure., Super edge-connectivity of de Bruijn and Kautz undirected graphs, \(\lambda ^{\prime}\)-optimal digraphs, On optimally-\(\lambda^{(3)}\) transitive graphs, Computational complexity of impact size estimation for spreading processes on networks, Super edge connectivity properties of connected edge symmetric graphs, Neighborhood conditions for graphs to be super restricted edge connected, Connectivity, stability and efficiency in a network as an information flow, Structural questions with GERT-networks, A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability, System Reliability Analysis in the Presence of Dependent Component Failures, Bounds on the Reliability Polynomial for Shellable Independence Systems, Application of Markov chains for the reliability analysis of systems with a complex structure
