Two-path subsets: Efficient counting and applications to performability analysis

Discrete Applied Mathematics

Volumn 85, Issue 1, 1998, Pages 25-45

  Ball, Michael O ^a   Hagstrom, Jane N ^b   Provan, J Scott ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Enumeration; Flow; Paths; Performability; PERT; Planar graph; Stochastic

Indexed keywords

EID: 0009481198     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00027-4     Document Type: Article

References (9)

1. M.O. Ball, J.N. Hagstrom, J.S. Provan, Threshold reliability of networks with small failure sets. Networks, 25 (1995) 101-115.
2. M.O. Ball, J.N. Hagstrom, J.S. Provan, Two-path subsets: Efficient counting and applications to peformability analysis. Technical Report UNC/OR95-5, Department of Operations Research, University of North Carolina, Chapel Hill, 1995. Available at http://www.or.unc.edu.
3. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
4. C.L. Monma, D.F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints, Oper. Res. 37 (1989) 531-541.
5. J.S. Provan, V.G. Kulkarni, Exact cuts in networks, Networks, 19 (1989) 281-289.
6. J. Scott Provan, Boolean decomposition schemes and the complexity of reliability computations, DIMACS Series in Discrete Mathematics and Theoret. Comput. Sci. 5 (1991) 213-228.
7. J. Scott Provan, The intractability of the 2-critical flow problem in k-flow graphs, Technical Report UNC/OR TR95-3, Department of Operations Research, University of North Carolina, Chapel Hill, 1995. Available at http://www.or.unc.edu.
8. K. Steiglitz, P. Weiner, D.J. Kleitman. The design of minimum-cost survivable networks, IEEE Trans Circuit Theory, CT-16 (1969) 455-460.
9. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979) 410-421.