-
1
-
-
84941446735
-
Computational complexity of network reliability analysis: An overview
-
Aug.
-
M. O. Ball, "Computational complexity of network reliability analysis: An overview," IEEE Trans. Reliability, vol. R-35, pp. 230-239, Aug. (1986).
-
(1986)
IEEE Trans. Reliability
, vol.R-35
, pp. 230-239
-
-
Ball, M.O.1
-
2
-
-
0024054677
-
A practical implementation of the factoring theorem for network reliability
-
Aug.
-
L. B. Page and J. E. Perry, "A practical implementation of the factoring theorem for network reliability," IEEE Trans. Reliability, vol. 37, pp. 259-267, Aug. 1988.
-
(1988)
IEEE Trans. Reliability
, vol.37
, pp. 259-267
-
-
Page, L.B.1
Perry, J.E.2
-
3
-
-
0024913854
-
Reliability of directed networks using the factoring theorem
-
Dec.
-
____, "Reliability of directed networks using the factoring theorem," IEEE Trans. Reliability, vol. 38, pp. 556-562, Dec. 1989.
-
(1989)
IEEE Trans. Reliability
, vol.38
, pp. 556-562
-
-
Page, L.B.1
Perry, J.E.2
-
4
-
-
82455174512
-
Factoring algorithms for computing K-terminal network
-
Aug.
-
R. K. Wood, "Factoring algorithms for computing K-terminal network," IEEE Trans. Reliability, vol. R-35, pp. 269-278, Aug. 1986.
-
(1986)
IEEE Trans. Reliability
, vol.R-35
, pp. 269-278
-
-
Wood, R.K.1
-
5
-
-
0026172999
-
Factoring & reductions for networks with imperfect vertices
-
Apr.
-
O. R. Theologous and J. G. Carlier, "Factoring & reductions for networks with imperfect vertices," IEEE Trans. Reliability, vol. 40, pp. 210-217, Apr. 1991.
-
(1991)
IEEE Trans. Reliability
, vol.40
, pp. 210-217
-
-
Theologous, O.R.1
Carlier, J.G.2
-
6
-
-
0000483766
-
Determining terminal-pair reliability based on edge expansion diagrams using OBDD
-
Sept.
-
S. Y. Kuo, S. K. Lu, and F. M. Yeh, "Determining terminal-pair reliability based on edge expansion diagrams using OBDD," IEEE Trans. Reliability, vol. 48, no. 3, pp. 234-246, Sept. 1999.
-
(1999)
IEEE Trans. Reliability
, vol.48
, Issue.3
, pp. 234-246
-
-
Kuo, S.Y.1
Lu, S.K.2
Yeh, F.M.3
-
7
-
-
0022769976
-
Graph-based algorithms for Boolean function manipulation
-
Aug.
-
R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Computers, vol. C-35, no. 8, pp. 677-691, Aug. 1986.
-
(1986)
IEEE Trans. Computers
, vol.C-35
, Issue.8
, pp. 677-691
-
-
Bryant, R.E.1
-
8
-
-
0025558645
-
Efficient implementation of an OBDD package
-
K. C. Brace, R. L. Rudell, and R. E. Bryant. "Efficient implementation of an OBDD package," in Proc. 27th Design Automation Conf., 1990, pp. 40-45.
-
Proc. 27th Design Automation Conf., 1990
, pp. 40-45
-
-
Brace, K.C.1
Rudell, R.L.2
Bryant, R.E.3
-
10
-
-
0031123823
-
OBDD-based network reliability calculation
-
Sept.
-
F. M. Yeh, and S. Y. Kuo, "OBDD-based network reliability calculation," Electronics Letters, vol. 33 no. 9 pp. 759-760, Sept. 1997.
-
(1997)
Electronics Letters
, vol.33
, Issue.9
, pp. 759-760
-
-
Yeh, F.M.1
Kuo, S.Y.2
-
11
-
-
84986992109
-
A recursive algorithm for finding reliability measures related to the connect of nodes in a graph
-
J. A. Buzacott, "A recursive algorithm for finding reliability measures related to the connect of nodes in a graph," Networks, vol. 10, pp. 311-327, 1980.
-
(1980)
Networks
, vol.10
, pp. 311-327
-
-
Buzacott, J.A.1
-
12
-
-
0025432031
-
Finding optimal variable ordering for binary decision diagrams
-
May
-
S. J. Friedman and K. J. Supowit, "Finding optimal variable ordering for binary decision diagrams," IEEE Trans. Computers, vol. 39, no. 5, pp. 710-713, May 1990.
-
(1990)
IEEE Trans. Computers
, vol.39
, Issue.5
, pp. 710-713
-
-
Friedman, S.J.1
Supowit, K.J.2
|