Network reliability analysis: Part I

DOI10.1002/NET.3230010307MaRDI QIDQ5650314zbMATH OpenOpenAlexFDO

Authors Richard Van Slyke, Howard Frank

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

Cites work

• scientific article; zbMATH DE number 3200151 (Why is no real title available?)
• Reliable circuits using less reliable relays

Cited in

(22)

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

This page was built for publication: Network reliability analysis: Part I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650314)