Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
type: Item
instance of: scholarly article
title: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
zbMATH Open document ID: 1110.05050
author: Endre Boros
author: Khaled Elbassioni
author: Kazuhisa Makino
author: Leonid G. Khachiyan
author: Vladimir Gurvich
published in: Discrete Applied Mathematics
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 5128018
zbMATH Keywords: path and cut enumeration
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.032
OpenAlex ID: W2007143256
cites work: Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
cites work: Algorithms and Computation
cites work: Integer Programming and Combinatorial Optimization
cites work: An efficient network flow code for finding all minimum cost \(s-t\) cutsets
cites work: Extracting maximal information about sets of minimum cuts
cites work: An algorithm for enumerating all spanning trees of a directed graph
cites work: Q3682236
cites work: Q3135082
cites work: Computing Network Reliability in Time Polynomial in the Number of Cuts
cites work: A paradigm for listing \((s,t)\)-cuts in graphs
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: Q4782696
cites work: Q4111952
cites work: An algorithm for enumerating all directed spanning trees in a directed graph
DOI: 10.1016/J.DAM.2006.04.032
description: scientific article; zbMATH DE number 5128018