Search for all \(d\)-mincuts of a limited-flow network

DOI10.1016/S0305-0548(01)00062-4zbMath1259.90155MaRDI QIDQ1941957

Yeh, Wei-Chang

Publication date: 25 March 2013

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

reliabilitymax-flowd-MClimited-flow network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (3)

Evaluating the reliability of a novel deterioration-effect multi-state flow network ⋮ A simple algorithm to search for all MCs in networks ⋮ An interactive augmented max-min MCS–RSM method for the multi-objective network reliability problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating pseudo-random permutations and maximum flow algorithms
• A Monte Carlo Sampling Plan for Estimating Network Reliability
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability Evaluation of Multistate Systems with Multistate Components
• A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness
• Improved Time Bounds for the Maximum Flow Problem
• The Complexity of Enumeration and Reliability Problems
• Bounding the Reliability of Multistate Systems
• A Simple Method for Reliability Evaluation of a Communication System
• Coherent Systems with Multi-State Components
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Reliability Evaluation of a Flow Network
• Search for MC in modified networks

This page was built for publication: Search for all \(d\)-mincuts of a limited-flow network