SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 75, Issue 3, 1997, Pages 285-295

Computing optimal assignments for residual network reliability

(2) Stivaros, C a Sutnerb, K b

a FAIRLEIGH DICKINSON UNIVERSITY (United States)

b Carnegie Mellon University ^* (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244550934 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)89164-0 Document Type: Article

Times cited : (4)

References (17)

1
- 84987014383
- The complexity of reliability computations
- M.O. Ball, The complexity of reliability computations, Networks 10 (1980) 153-165.
- (1980) Networks , vol.10 , pp. 153-165
- Ball, M.O.¹

2
- 0346179968
- Univ. Waterloo Res. Report, CORR 73-21
- V. Chvátal and P.L. Hammer, Set-packing and threshold graphs, Univ. Waterloo Res. Report, CORR 73-21.
- Set-packing and Threshold Graphs
- Chvátal, V.¹ Hammer, P.L.²

3
- 0004061765
- Oxford University Press, Oxford
- C.J. Colbourn, The Combinatorics of Network Reliability (Oxford University Press, Oxford, 1987).
- (1987) The Combinatorics of Network Reliability
- Colbourn, C.J.¹

4
- 38248999680
- Computing residual connectedness reliability for restricted networks
- C. Colbourn, A. Satyanarayana, C. Suffel and K. Sutner, Computing residual connectedness reliability for restricted networks, Discrete Appl. Math. 44 (1993) 221-232.
- (1993) Discrete Appl. Math. , vol.44 , pp. 221-232
- Colbourn, C.¹ Satyanarayana, A.² Suffel, C.³ Sutner, K.⁴

5
- 84985867429
- Algorithms for K-terminal reliability problems with node failures
- E.C. Elmallah, Algorithms for K-terminal reliability problems with node failures, Networks 22 (1992) 369-384.
- (1992) Networks , vol.22 , pp. 369-384
- Elmallah, E.C.¹

6
- 0004127488
- Freeman, New York
- M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, New York, 1979).
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

7
- 0003947606
- Academic Press, New York
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

8
- 0024647275
- Invariant permutations for consecutive 2-out-of-n cycles
- F.K. Hwang, Invariant permutations for consecutive 2-out-of-n cycles, IEEE Trans. on Reliability 38 (1989) 65-67.
- (1989) IEEE Trans. on Reliability , vol.38 , pp. 65-67
- Hwang, F.K.¹

9
- 0021626405
- Optimal consecutive-2-out-of-n: F component sequencing
- D.M. Malon, Optimal consecutive-2-out-of-n: F component sequencing. IEEE Trans. Reliability 33 (1985) 414-418.
- (1985) IEEE Trans. Reliability , vol.33 , pp. 414-418
- Malon, D.M.¹

10
- 0003897694
- Addison-Wesley, Reading, MA
- C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
- (1994) Computational Complexity
- Papadimitriou, C.H.¹

11
- 0022769608
- The complexity of reliability computations in planar and acyclic graphs
- J. Provan, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput. 15 (1986) 695-702.
- (1986) SIAM J. Comput. , vol.15 , pp. 695-702
- Provan, J.¹

12
- 0022162116
- A linear time algorithm for computing the K-terminal reliability in series-parallel networks
- A. Satyanarayana and R. Wood, A linear time algorithm for computing the K-terminal reliability in series-parallel networks, SIAM J. Comput. 14 (1985) 818-832.
- (1985) SIAM J. Comput. , vol.14 , pp. 818-832
- Satyanarayana, A.¹ Wood, R.²

13
- 0004233425
- Addison-Wesley, Reading, MA
- A. Silberschatz, J. Peterson and P. Galvin, Operating System Concepts (Addison-Wesley, Reading, MA, 1991).
- (1991) Operating System Concepts
- Silberschatz, A.¹ Peterson, J.² Galvin, P.³

14
- 85025288080
- The complete multipartite networks are not always reliable
- C. Stivaros, The complete multipartite networks are not always reliable, J. Congr. Numer. 88 (1992) 193-206.
- (1992) J. Congr. Numer. , vol.88 , pp. 193-206
- Stivaros, C.¹

15
- 30244508110
- Uniformly optimal networks in the residual node connectedness reliability model
- C. Stivaros and C. Suffel, Uniformly optimal networks in the residual node connectedness reliability model, J. Congr. Numer. 81 (1991) 51-63.
- (1991) J. Congr. Numer. , vol.81 , pp. 51-63
- Stivaros, C.¹ Suffel, C.²

16
- 0026108306
- The complexity of the residual node connectedness reliability problem
- K. Sutner, A. Satyanarayana and C. Suffel, The complexity of the residual node connectedness reliability problem, SIAM J. Comput. 20 (1991) 149-155.
- (1991) SIAM J. Comput. , vol.20 , pp. 149-155
- Sutner, K.¹ Satyanarayana, A.² Suffel, C.³

17
- 0000142982
- The complexity of enumeration and reliability problems
- L. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.
- (1979) SIAM J. Comput. , vol.8 , pp. 410-421
- Valiant, L.¹

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