Iterative algorithms for generating minimal cutsets in directed graphs

DOI10.1002/NET.3230160203MaRDI QIDQ3783817zbMATH OpenOpenAlexFDO

Authors D. E. Whited, Douglas R. Shier

Publication date 1986

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

directed graphminimal cutsetsnetwork reliabilityreliability evaluationunderlying algebraic structure

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• scientific article; zbMATH DE number 1234600
• scientific article; zbMATH DE number 3999696
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Approximating minimum feedback sets and multicuts in directed graphs
• Algorithms for Generating Minimal Cutsets by Inversion
• An iterated greedy algorithm for finding the minimum dominating set in graphs
• On computing minimum(s,t)-cuts in digraphs
• A parallel algorithm for finding minimum cutsets in reducible graphs
• Algorithms to compute minimum cycle basis in directed graphs
• Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)

Cites work

• A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• Properties of Labeling Methods for Determining Shortest Path Trees

Cited in

(15)

• Approximating minimum feedback sets and multicuts in directed graphs
• The preemptive stochastic resource-constrained project scheduling problem
• Maximizing the expected net present value of a project with phase-type distributed activity durations: an efficient globally optimal solution procedure
• An inverse problem of the weighted shortest path problem
• Scheduling Markovian PERT networks to maximize the net present value
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• Random iteration algorithm for graph-directed sets
• Algorithms for Generating Minimal Cutsets by Inversion
• A Method for Evaluating All the Minimal Cuts of a Graph
• Simple enumeration of minimal cutsets of acyclic directed graph
• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• scientific article; zbMATH DE number 1234600 (Why is no real title available?)
• Finding and using directed cuts of real graphs of algorithms
• Network reliability: Heading out on the highway
• Probabilistic inference in multiply connected belief networks using loop cutsets

This page was built for publication: Iterative algorithms for generating minimal cutsets in directed graphs

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