Network reliability analysis: Part I

DOI10.1002/net.3230010307zbMath0239.94041OpenAlexW2006811678MaRDI QIDQ5650314

Howard Frank, R. M. Van Slyke

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230010307

Mathematics Subject Classification ID

Related Items

Sixty years of network reliability, Monte-Carlo algorithms for the planar multiterminal network reliability problem, Edge-packings of graphs and network reliability, Lower bounds on two-terminal network reliability, Counting almost minimum cutsets with reliability applications, Uniformly optimally reliable graphs: A survey, Network reliability: Heading out on the highway, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, On network reliability evaluation by Monte Carlo method using high-performance computing, Minimal spanning trees and partial sorting, Network Resilience, Reliability analysis of networks using stochastic model, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, A Highly Efficient Monte Carlo Method for Assessment of System Reliability Based on a Markov Model, Analyse und Synthese zuverlässiger Netze, Chip firing and all-terminal network reliability bounds, Bounds on the Reliability Polynomial for Shellable Independence Systems, The expected number of pairs of connected nodes: Pair-connected reliability, Analysis and synthesis problems for network resilience, Cutting numbers for the forward loop backward hop network, The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds

Cites Work

• Reliable circuits using less reliable relays
• Unnamed Item