Iterative algorithms for generating minimal cutsets in directed graphs

DOI10.1002/net.3230160203zbMath0642.90043OpenAlexW2145704801MaRDI QIDQ3783817

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 graphnetwork reliabilityreliability evaluationminimal cutsetsunderlying algebraic structure

Mathematics Subject Classification ID

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

Related Items

An inverse problem of the weighted shortest path problem, Network reliability: Heading out on the highway, Probabilistic inference in multiply connected belief networks using loop cutsets, 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, Scheduling Markovian PERT networks to maximize the net present value

Cites Work

• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• Properties of Labeling Methods for Determining Shortest Path Trees
• A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
• Unnamed Item