-
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
-
-
3142780224
-
Analysis of probabilistic networks
-
Sept.
-
O. Wing and P. Demetriou, “Analysis of probabilistic networks,” IEEE Trans. Commun. Technol., vol. COM-12, pp. 38–40, Sept. 1964.
-
(1964)
IEEE Trans. Commun. Technol.
, vol.COM-12
, pp. 38-40
-
-
Wing, O.1
Demetriou, P.2
-
3
-
-
79960427473
-
All paths through a maze
-
(Lett.) Jan.
-
D. Kroft, “All paths through a maze,” Proc. IEEE (Lett.), vol. 55, pp. 88–90, Jan. 1967.
-
(1967)
Proc. IEEE
, vol.55
, pp. 88-90
-
-
Kroft, D.1
-
5
-
-
0001350941
-
On finding the simple paths and circuits in a graph
-
(Corresp.) Sept.
-
G. H. Danielson, “On finding the simple paths and circuits in a graph,” IEEE Trans. Circuit Theory (Corresp.), vol. CT-15, pp. 294–295, Sept. 1968.
-
(1968)
IEEE Trans. Circuit Theory
, vol.CT-15
, pp. 294-295
-
-
Danielson, G.H.1
-
6
-
-
84938439970
-
All simple paths in a graph by solving a system of linear equations
-
IEI, Pisa, Italy, Tech. Note B71-11. to be published
-
L. Fratta and U. Montanari, “All simple paths in a graph by solving a system of linear equations,” IEI, Pisa, Italy, Tech. Note B71-11. to be published.
-
-
-
Fratta, L.1
Montanari, U.2
-
8
-
-
0014781752
-
A computer program for approximating system reliability
-
May
-
A. C. Nelson, Jr., J. R. Batts, and R. L. Beadles, “A computer program for approximating system reliability,” IEEE Trans. Rel., vol. R-19, pp. 61–65, May 1970.
-
(1970)
IEEE Trans. Rel.
, vol.R-19
, pp. 61-65
-
-
Nelson, A.C.1
Batts, J.R.2
Beadles, R.L.3
-
9
-
-
0015111787
-
A computerized algorithm for determining the reliability of redundant configurations
-
Aug.
-
D. B. Brown, “A computerized algorithm for determining the reliability of redundant configurations,” IEEE Trans. Rel., vol. R-20, pp. 121–124, Aug. 1971.
-
(1971)
IEEE Trans. Rel.
, vol.R-20
, pp. 121-124
-
-
Brown, D.B.1
-
10
-
-
0014738777
-
Reliability analysis of redundant networks using flow graphs
-
Feb.
-
K. B. Misra and T. S. M. Rao, “Reliability analysis of redundant networks using flow graphs,” IEEE Trans. Rel., vol. R-19, pp. 19–24, Feb. 1970.
-
(1970)
IEEE Trans. Rel.
, vol.R-19
, pp. 19-24
-
-
Misra, K.B.1
Rao, T.S.M.2
-
11
-
-
0015201880
-
A procedure for calculating the reliability of a communication network
-
Dec.
-
E. Hänsler, “A procedure for calculating the reliability of a communication network,” Arch. Elek. Übertragung, vol. 25, pp. 573–575, Dec. 1971.
-
(1971)
Arch. Elek. Übertragung
, vol.25
, pp. 573-575
-
-
Hänsler, E.1
-
13
-
-
0015202997
-
Network reliability analysis: Part I
-
R. Van Slyke and H. Frank, “Network reliability analysis: Part I,” Networks, vol. 1, pp. 279–290, 1972.
-
(1972)
Networks
, vol.1
, pp. 279-290
-
-
Van Slyke, R.1
Frank, H.2
-
14
-
-
0014868186
-
Analysis and design of survivable networks
-
Oct.
-
H. Frank and I. T. Frisch, “Analysis and design of survivable networks,” IEEE Trans. Commun. Technol., vol. COM-18, pp. 501–519, Oct. 1970.
-
(1970)
IEEE Trans. Commun. Technol.
, vol.COM-18
, pp. 501-519
-
-
Frank, H.1
Frisch, I.T.2
-
15
-
-
84948610249
-
Analysis and design of reliable computer networks
-
June
-
R. S. Wilkov, “Analysis and design of reliable computer networks,” IEEE Trans. Commun. Technol., vol. COM-20, pp. 660–678, June 1972.
-
(1972)
IEEE Trans. Commun. Technol.
, vol.COM-20
, pp. 660-678
-
-
Wilkov, R.S.1
-
16
-
-
84937647320
-
Terminal reliability in a communication network: An efficient algorithm
-
July
-
L. Fratta and U. Montanari, “Terminal reliability in a communication network: An efficient algorithm,” in Proc. 2nd Int. Symp. Network Theory, pp. 391–398, July 1972.
-
(1972)
Proc. 2nd Int. Symp. Network Theory
, pp. 391-398
-
-
Fratta, L.1
Montanari, U.2
|