SCOPUS 정보 검색 플랫폼

Networks

Volumn 13, Issue 1, 1983, Pages 107-120

Network reliability and the factoring theorem

(2) Satyanarayana, A a,b Chang, Mark K a,c

a UNIVERSITY OF CALIFORNIA (United States)

b UNIVERSITY OF WISCONSIN STEVENS POINT (United States)

c Pacific Telephone ^* (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0020545560 PISSN: 00283045 EISSN: 10970037 Source Type: Journal
DOI: 10.1002/net.3230130107 Document Type: Article

Times cited : (188)

References (36)

1
- 0018455846
- An improved algorithm for network reliability
- (1979) IEEE Trans. Reliability , vol.28 R , pp. 58-61
- Abraham, J.A.¹

2
- 0016495435
- A fast algorithm for reliability evaluation
- (1975) IEEE Trans. Reliability , vol.24 R , pp. 83-85
- Aggarwal, K.K.¹ Misra, K.B.² Gupta, J.S.³

3
- 84987014383
- Complexity of network reliability computations
- (1980) Networks , vol.10 , pp. 153-165
- Ball, M.¹

4
- 0018493667
- Computing network reliability
- (1979) Operations Res. , vol.27 , pp. 823-838
- Ball, M.¹

5
- 0008298440
- Backtracking algorithms for network reliability
- (1977) Ann. Discrete Math. , vol.1 , pp. 49-64
- Ball, M.¹ Van Slyke, R.M.²

6
- 84986997103
- Statistical Theory of Reliability and Life Testing. Holt, Rinehart and Winston
- (1975)
- Barlow, R.E.¹ Proschan, F.²

7
- 0013035797
- Multi‐component systems and structures and their reliability
- (1961) Technometrics , vol.3 , pp. 55-77
- Birnbaum, Z.W.¹ Esary, J.D.² Saunders, S.C.³

8
- 0015111787
- A computerized algorithm for determining the reliability of redundant configurations
- (1971) IEEE Trans. Reliability , vol.20 R , pp. 121-124
- Brown, D.B.¹

9
- 84986992109
- A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
- (1980) Networks , vol.10 , pp. 311-327
- Buzacott, J.A.¹

10
- 84986978410
- Ph.D. Thesis, University of California, Berkeley
- (1981)
- Chang, M.K.¹

11
- 0014868186
- Analysis and design of survivable networks
- (1970) IEEE Transactions on Communications , vol.18 COM , pp. 501-519
- Frank, H.¹ Frisch, I.T.²

12
- 0015626643
- A Boolean algebra method for computing terminal reliability in a communication network
- (1973) IEEE Transactions on Circuit Theory , vol.20 CT , pp. 203-211
- Fratta, L.¹ Montanari, U.²

13
- 0015360568
- A fast recursive algorithm to calculate the reliability of a communication network
- (1972) IEEE Trans. Commun. , vol.20 COM , pp. 637-640
- Hansler, E.¹

14
- 0015994389
- Exact calculation of a communication network
- (1974) Networks , vol.4 , pp. 95-112
- Hansler, E.¹ McAuliffe, G.K.² Wilcov, R.S.³

15
- 0003780715
- Addison‐Wesley, Reading, MA
- (1972) Graph Theory
- Harary, F.¹

16
- 0001243769
- Dividing a graph into triconnected components
- (1973) SIAM Journal on Computing , vol.2 , pp. 135-158
- Hopcroft, J.E.¹ Tarjan, R.E.²

17
- 84986969688
- Network reliability and permutation partitioning. Working paper, University of California, Berkeley
- (1980)
- Johnson, R.¹

18
- 0015432851
- A method for computing complex system reliability
- (1972) IEEE Trans. Reliability , vol.21 R , pp. 215-219
- Kim, Y.H.¹ Case, K.E.² Ghare, P.M.³

19
- 0016944224
- A new algorithm for symbolic system reliability analysis
- (1976) IEEE Trans. Reliability , vol.25 R , pp. 2-15
- Lin, P.M.¹ Leon, B.J.² Huang, T.C.³

20
- 84937350381
- Reliability of physical systems
- (1959) IRE Transactions on Circuit Theory , vol.6 CT , pp. 138-151
- Mine, H.¹

21
- 0008735267
- A simple algorithm for listing all the trees of a graph
- (1965) IEEE Transactions on Circuit Theory , vol.12 CT , pp. 120
- Minty, G.J.¹

22
- 0014878283
- An algorithm for the reliability evaluation of redundant networks
- (1970) IEEE Trans. Reliability , vol.19 R , pp. 146-151
- Misra, K.B.¹

23
- 0014738777
- Reliability analysis of redundant networks using flow graphs
- (1970) IEEE Trans. Reliability , vol.19 R , pp. 19-24
- Misra, K.B.¹ Rao, T.S.M.²

24
- 0040548676
- The analysis of redundancy networks
- (1958) AIEE Trans. Commun. Electron. , vol.39 , pp. 627-632
- Moskowitz, F.¹

25
- 84986948355
- The complexity of counting cuts and of computing the probability that a graph is connected. Working paper MS/S 81–002
- (1981)
- Provan, J.S.¹ Ball, M.²

26
- 0002529522
- An introduction to chromatic polynomials
- (1968) J. Combinatorial Theory , vol.4 , pp. 52-71
- Read, R.C.¹

27
- 0017473944
- Computing the reliability of complex networks
- (1977) SIAM J. Appl. Math. , vol.32 , pp. 384-393
- Rosenthal, A.¹

28
- 0020116094
- A unified formula for analysis of some network reliability problems
- (1982) IEEE Trans. Reliability , vol.31 R , pp. 23-32
- Satyanarayana, A.¹

29
- 69249154423
- Report ORC 80–6, Operations Research Center, University of California, Berkeley
- (1980) Multi‐terminal network reliability
- Satyanarayana, A.¹

30
- 0019624728
- New algorithm for the analysis of multi‐terminal network reliability
- (1981) IEEE Trans. Reliability , vol.30 R , pp. 325-334
- Satyanarayana, A.¹ Hagstrom, J.N.²

31
- 0019691524
- Combinatorial properties of directed graphs useful in computing network reliability
- (1981) Networks , vol.11 , pp. 357-366
- Satyanarayana, A.¹ Hagstrom, J.N.²

32
- 0017981557
- New topological formula and rapid algorithm for reliability analysis of complex networks
- (1978) IEEE Trans. Reliability , vol.27 R , pp. 82-100
- Satyanarayana, A.¹ Prabhakar, A.²

33
- 84986991953
- Depth‐first search and linear graph algorithms
- (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
- Tarjan, R.E.¹

34
- 84986947454
- The complexity of enumeration and reliability problems
- (1979) SIAM Journal on Computing , vol.8 , pp. 410-421
- Valiant, L.G.¹

35
- 84948610249
- Analysis and design of reliable computer networks
- (1972) IEEE Transactions on Communications , vol.20 COM , pp. 660-678
- Wilcov, R.S.¹

36
- 3142780224
- Analysis of probabilistic networks
- (1964) IEEE Trans. Commun. Technol. , vol.12 COM , pp. 34-40
- Wing, O.¹ Demetriou, P.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.