Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Discrete Applied Mathematics

Volumn 155, Issue 2, 2007, Pages 137-149

  Khachiyan, Leonid ^a   Boros, Endre ^b   Elbassioni, Khaled ^c   Gurvich, Vladimir ^b   Makino, Kazuhisa ^d  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d UNIVERSITY OF TOKYO   (Japan)

Author keywords

Disjunction and conjunctions of paths and cuts; Path and cut enumeration; Reliability theory

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

PATH AND CUT ENUMERATION; PATH DISJUNCTIONS; POLYNOMIAL DELAY ALGORITHMS; POLYNOMIAL TIME;

RELIABILITY THEORY;

EID: 33751167402     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.032     Document Type: Article

References (16)

1. Abel U., and Bicker R. Determination of all cutsets between a node pair in an undirected graph. IEEE Trans. Reliability 31 (1986) 167-171
2. Bansal V.K., Misra K.B., and Jain M.P. Minimal pathset and minimal cutset using search technique. Microelectr. Reliability 22 (1982) 1067-1075
3. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, Algorithms for enumerating circuits in matroids, in: T. Ibaraki, N. Katoh, H. Ono (Eds.), 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, Heidelberg, New York, 2003, pp. 485-494.
4. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems, in: D. Bienstock, G. Nemhauser (Eds.), Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, Lecture Notes in Computer Science, vol. 3064, Springer, Berlin, Heidelberg, New York, 2004, pp. 152-162.
5. Colburn C.J. The Combinatorics of Network Reliability (1987), Oxford University Press, New York
6. Curet N.D., DeVinney J., and Gaston M.E. An efficient network flow code for finding all minimum cost s - t cutsets. Comput. Oper. Res. 29 (2002) 205-219
7. Gusfield D., and Naor D. Extracting maximum information about sets of minimum cuts. Algorithmica 10 (1993) 64-89
8. Kapoor S., and Ramesh H. An algorithm for enumerating all spanning trees of a directed graph. Algorithmica 27 (2000) 120-130
9. L. Lovász, Submodular functions and convexity, in: Mathematical Programming: The State of the Art, Bonn 1982, Springer, Berlin, 1983, pp. 235-257.
10. Oxley J. Matroid Theory (1992), Oxford University Press, Oxford
11. Provan J.S., and Ball M.O. Computing network reliability in time polynomial in the number of cuts. Oper. Res. 32 (1984) 516-526
12. Provan J.S., and Shier D.R. A paradigm for listing (s, t) cuts in graphs. Algorithmica 15 (1996) 351-372
13. Read R.C., and Tarjan R.E. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5 (1975) 237-252
14. T. Uno, An algorithm for enumerating all directed spanning trees in a directed graph, in: T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, S. Suri (Eds.), Seventh International Symposium on Algorithms and Computation (ISAAC 1996), Lecture Notes in Computer Science, vol. 1178, Springer, Berlin, Heidelberg, New York, 1996, pp. 166-173.
15. V. Vazirani, Approximation Algorithms, Springer, Berlin, 2001.
16. Welsh D.J.A. Matroid Theory (1976), Academic Press, London, New York, San Francisco