Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

DOI10.1016/j.dam.2006.04.032zbMath1110.05050OpenAlexW2007143256MaRDI QIDQ867855

Khaled M. Elbassioni, Endre Boros, Kazuhisa Makino, Leonid G. Khachiyan, Vladimir A. Gurvich

Publication date: 19 February 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.032

zbMATH Keywords

path and cut enumeration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Enumeration in graph theory (05C30) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Scientific contributions of Leo Khachiyan (a short overview) ⋮ The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extracting maximal information about sets of minimum cuts
• A paradigm for listing \((s,t)\)-cuts in graphs
• An algorithm for enumerating all spanning trees of a directed graph
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Algorithms and Computation
• Integer Programming and Combinatorial Optimization
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets

This page was built for publication: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory