Parametric max flow problems in a class of networks with series-parallel structure

DOI10.1016/0305-0548(94)90006-XzbMath0805.90044MaRDI QIDQ1332816

B. K. Yoo, Chang Sup Sung

Publication date: 31 January 1995

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

zbMATH Keywords

basically-series-parallel networksminimal cutset enumerationparametric max flow network problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)

Cites Work

• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Algorithms for Generating Minimal Cutsets by Inversion
• A New Technique in Minimal Path and Cutset Evaluation
• Network reliability analysis using 2-connected digraph reductions
• Simple enumeration of minimal cutsets of acyclic directed graph
• Computer Program for Approximating the Reliability Characteristics of Acyclic Directed Graphs
• Inverting and Minimalizing Path Sets and Cut Sets
• Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Parametric max flow problems in a class of networks with series-parallel structure