-
1
-
-
0002571581
-
Analysis of Switching Networks
-
Nov.
-
C. Y. Lee, “Analysis of Switching Networks”, Bell Syst. Tech. J., pp. 1287-1315, Nov. 1955.
-
(1955)
Bell Syst. Tech. J.
, pp. 1287-1315
-
-
Lee, C.Y.1
-
2
-
-
84937647320
-
Terminal Reliability in a Communication Network: An Efficient Algorithm
-
Herceg-Novi, July
-
L. Fratta and U. Montanari, “Terminal Reliability in a Communication Network: An Efficient Algorithm”, Proc. of Int. Symp. Network Theory, Herceg-Novi, July 1972.
-
(1972)
Proc. of Int. Symp. Network Theory
-
-
Fratta, L.1
Montanari, U.2
-
3
-
-
0015626643
-
A Boolean Algebra Method for Computing the Terminal Reliability in a Communications Network
-
L. Fratta and U. Montanari, “A Boolean Algebra Method for Computing the Terminal Reliability in a Communications Network”. IEEE Trans. on Circuit Theory, CT-20, 3, (1973), 203–211.
-
(1973)
IEEE Trans. on Circuit Theory
, vol.CT-20
, Issue.3
, pp. 203-211
-
-
Fratta, L.1
Montanari, U.2
-
4
-
-
0016970720
-
Synthesis of Available Networks
-
June
-
L. Fratta, and U. Montanari, “Synthesis of Available Networks” IEEE Trans. on Rel, vol. R25, No. 2, June 1976, pp. 81-87.
-
(1976)
IEEE Trans. on Rel
, vol.R25
, Issue.2
, pp. 81-87
-
-
Fratta, L.1
Montanari, U.2
-
5
-
-
0015994389
-
Exact Calculation of Computer Network Reliability
-
E. Hänsler, G. K. McAuliffe and R. S. Wilkov, “Exact Calculation of Computer Network Reliability”, Networks, 4, (1974), 95-112.
-
(1974)
Networks
, vol.4
, pp. 95-112
-
-
Hänsler, E.1
McAuliffe, G.K.2
Wilkov, R.S.3
-
6
-
-
84937656802
-
An Efficient Algorithm for the Symbolic Solution of the Network Reliability
-
Internal Air Force Weapons Laboratory, Kirthland AFB, New Mexico.
-
W. P. Dotson Jr., “An Efficient Algorithm for the Symbolic Solution of the Network Reliability”, Internal Air Force Weapons Laboratory, Kirthland AFB, New Mexico.
-
-
-
Dotson, W.P.1
-
7
-
-
84976669902
-
A447–Efficient Algorithms for Graph Manipulation
-
June
-
J. Hopcroft and R. Tarjan, “A447–Efficient Algorithms for Graph Manipulation”, CACM vol. 16, n. 6, June 1973, 372-378.
-
(1973)
CACM
, vol.16
, Issue.6
, pp. 372-378
-
-
Hopcroft, J.1
Tarjan, R.2
-
8
-
-
0002443066
-
Isomorphism of Planar Graphs
-
(R. Miller and J. Thatcher editors) Plenum Press–1972,
-
J. Hopcroft and R. Tarjan, “Isomorphism of Planar Graphs”, Complexity of Computer Computations (R. Miller and J. Thatcher editors) Plenum Press–, 131-152.
-
(1972)
Complexity of Computer Computations
, pp. 131-152
-
-
Hopcroft, J.1
Tarjan, R.2
-
9
-
-
0014778569
-
Separable Graphs, Planar Graphs and Web Grammars
-
U. Montanari, “Separable Graphs, Planar Graphs and Web Grammars”, Information and Control, 16 (1970), 243-267.
-
(1970)
Information and Control
, vol.16
, pp. 243-267
-
-
Montanari, U.1
-
10
-
-
84914187554
-
private communication
-
E. Hänsler, private communication, 1973.
-
(1973)
-
-
Hänsler, E.1
-
12
-
-
0016495435
-
A Fast Algorithm for Reliability Evaluation
-
April
-
K. K. Aggarwal, K. B. Misra, “A Fast Algorithm for Reliability Evaluation”, IEEE Transactions on Reliability, Vol. R-24, No. 1, April 1975.
-
(1975)
IEEE Transactions on Reliability
, vol.R-24
, Issue.1
-
-
Aggarwal, K.K.1
Misra, K.B.2
-
14
-
-
0015360568
-
A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network
-
June
-
E. Hänsler, “A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network” IEEE Transaction on Communications, vol. COM-20, No. 3, June 1972.
-
(1972)
IEEE Transaction on Communications
, vol.COM-20
, Issue.3
-
-
Hänsler, E.1
|