Computational investigations of all-terminal network reliability via BDDs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 5, 1999, Pages 714-721

  Imai, Hiroshi ^a   Serine, Kyoko ^a   Imai, Keiko ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

pcomplete; BDD; Network reliability; Output size sensitive

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; POLYNOMIALS; PROBABILITY DENSITY FUNCTION;

NETWORK RELIABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032653286     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. N. Alon, A. Frieze, and D. Welsh, Polynomial time randomized approximation schemes for Tutte-Grothendicck invariants: The dense case," Random Structures Algorithms, vol.6, no.4, pp.459-478, 1995.
2. J.D. Annan, The Complexity of Counting Problems," Ph.D. Thesis, University of Oxford, 199-1.
3. M.O. Ball and J.S. Provan, Calculating bounds on reachability and connectedness in stochastic networks," Networks, vol.13, pp.253-278, 1983.
4. B. Bollobds, Random Graphs," Academic Press, 1985.
5. R.E. Bryant, Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., vol.C-35, pp.677-691, 1986.
6. C.J. Colbourn, The Combinatorics of Network Reliability," Oxford University Press, 1987.
7. G.S. Fishman, A Monte Carlo sampling plan for estimating network reliability," Operations Research, vol.34, no.4, pp.581-594, 1986.
8. G.S. Fishman, A Monte Carlo sampling plan for estimating reliability parameters and related functions," Networks, vol.17, pp.169-186, 1987.
9. D.D. Harms, M. Kraetzl, C.J. Colbourn, and J.S. Devitt, Network Reliability: Experiments with a Symbolic Algebra Environment," CRC Press, Inc., 1995.
10. Y. Higashiyama, II. Ariyoshi, I. Shirakawa, and S. Ohba, A factored reliability formula for directed source-to-allterminal networks," IEICE Trans. Fundamentals, vol.E77A, no.l, pp.134-143, Jan. 1994.
11. H. Imai, Network Reliablity Computation and Related Issues-New Trends in Combinatorial Enumeration/Counting," in Discrete Structures and Algorithms V, ed. S. Fujishige, pp.1-50, Kindai-Kagaku-sha, 1998.
12. H. Imai, K. Imai, and K. Sekine, Parametric and sensitivity analysis of network reliability," in preparation.
13. H. Imai, K. Sekine, and K. Imai, Network reliability computation-Theory and practice," Proc. IPSJ Int. Symp. on Information Systems and Technologies for Network Society, World Scientific, pp.41-48, 1997.
14. M. Iri and K. Kubota, Norms, rounding errors, partial derivatives and fast automatic differentiation," IEICE Trans. Fundamentals, vol.E74-A, no.3, pp.463-471, March 1991.
15. D.R. Karger, A randomized fully polynomial time approximation scheme for the all terminal network reliability problem," Proc. 27th Annual ACM Symp. on Theory of Computing, pp.11-17, 1995.
16. D. Karger and R.P. Tai, Implementing a fully polynomial time approximation scheme for all terminal network reliability," Proc. SIAM-ACM Symp. on Discrete Algorithms, pp.334-343, 1997.
17. R.M. Karp and M. Luby, Monte-Carlo algorithms for the planar multiterminal network reliability problem," J. of Complexity, vol.1, pp.45-64, 1985.
18. R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs," SIAM Journal on Applied Mathematics, vol.36, no.2, pp.177-189, 1979.
19. H. Nagamochi and T. Ibaraki, Maximum flows in probabilistic networks," Networks, vol.21, pp.645-666, 1991.
20. H. Nagamochi and T. Ibaraki, On Onaga's upper bound on the mean values of probabilistic maximum flows," IEEE Trans. Reliability, vol.41, no.2, pp.225-229, 1992.
21. L.D. Nel and C.J. Colbourn, Combining Monte Carlo estimates and bounds for network reliability," Networks, vol.20, pp.277-298, 1990.
22. J.S. Provan, The complexity of reliability computations in planar and acyclic graphs," SIAM J. Comput., vol.15, no.3, pp.694-702, 1986.
23. A. Ramanathan and C.J. Colbourn, Counting almost minimum network cutsets with reliability applications," Mathematical Programming, vol.39, pp.253-261, 1987.
24. K. Sekine, Algorithm for Computing the Tutte Polynomial and Its Applications," Doctoral Thesis, Department of Information Science, University of Tokyo, 1997.
25. K. Sekine and H. Imai, A unified approach via BDD to the network reliability and path numbers," Tech. Rep. 95-09, Department of Information Science, University of Tokyo, 1995.
26. K. Sekine and H. Imai, Counting the number of paths in a graph via HDDs," IEICE Trans. Fundamentals, vol.E80-A, no.4, pp.682-688, April 1997.
27. K. Sekine, H. Imai, and S. Tani, Computing the Tuttc polynomial of a graph of moderate size," Proc. 6th Int. Symp. on Algorithms and Computation (ISAAC'95), Lecture Notes in Computer Science, vol.1004, pp.224-233, 1995.
28. D.R. Shier, Network Reliability and Algebraic Structures," Oxford University Press, 1991.
29. S. Shinmori, T. Koide, and H. Ishii, On lower bound for network reliability by edge-packing," Trans, of the Japan Society for Industrial and Applied Mathematics, vol.5, no.2, pp.139-151, 1995.
30. W.T. Tutte, A contribution to the theory of chromatic polynomials," Canadian J. Math., vol.6, pp.80-91, 1954.
31. L.G. Valiant, The complexity of enumeration and reliability problems," SIAM J. Comput., vol.8, no.3, pp.410-421, 1979.
32. D.J.A. Welsh, Complexity: Knots, colourings and counting," London Mathematical Society Lecture Note Series, vol.186, Cambridge University Press, 1993.