SCOPUS 정보 검색 플랫폼

Networks

Volumn 13, Issue 2, 1983, Pages 253-278

Calculating bounds on reachability and connectedness in stochastic networks

(2) Ball, Michael O a Provan, J Scott b,c

a UNIVERSITY OF MARYLAND (United States)

b NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY (United States)

c UNIVERSITY OF NORTH CAROLINA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RELIABILITY THEORY;

NETWORKS;

MATHEMATICAL TECHNIQUES;

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

Times cited : (119)

References (32)

1
- 0003415652
- Addison‐Wesley, Reading, MA
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.¹ Hopcroft, J.E.² Ullman, J.D.³

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

3
- 84986925846
- Network reliability analysis: algorithms and complexity. Ph.D. Thesis, Cornell University
- (1977)
- Ball, M.O.¹

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

5
- 0041776238
- Bounds on the reliability problem for shellable independence systems
- (1982) SIAM Journal on Algebraic Discrete Methods , vol.3 , pp. 166-181
- Ball, M.O.¹ Provan, J.S.²

6
- 0016526553
- The minimum number of edges and vertices in a graph with edge connectivity N and MN‐Bonds
- (1975) Networks , vol.5 , pp. 259-298
- Bixby, R.¹

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

8
- 0001769095
- Edge disjoint branchings
- R. Rustin, Algorithmics, New York
- (1972) Combinatorial Algorithms , pp. 91-96
- Edmonds, J.¹

9
- 0000682065
- Network flow and testing graph connectivity
- (1975) SIAM Journal on Computing , vol.4 , pp. 507-518
- Even, S.¹ Tarjan, R.E.²

10
- 84957946170
- Princeton University, Princeton, NJ
- (1962) Flows in Networks
- Ford, L.R.¹ Fulkerson, D.R.²

11
- 85012580040
- Computer communication network design‐Experience with theory and practice
- (1972) AFIPS Natl. Comput. Conf. Expo. Conf. Proc. , vol.40 , pp. 255-270
- Frank, H.¹ Kahn, R.E.² Kleinrock, L.³

12
- 84986996632
- Applications of an algorithm for networks
- (1980) Congressus Numeratium , vol.2 , pp. 31-38
- Gardner, M.L.¹

13
- 0003603813
- Freeman, San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP‐Completeness
- Garey, M.R.¹ Johnson, D.S.²

14
- 0001587029
- Maximum flow in (s, t) planar networks
- (1981) Information Processing Lett. , vol.13 , pp. 107
- Hassin, R.¹

15
- 0042791001
- Maximum flow in planar networks
- (1979) SIAM Journal on Computing , vol.8 , pp. 135-150
- Itai, A.¹ Shiloach, Y.²

16
- 85023251747
- A theorem of finite sets. In Theory of Graphs (Proceedings of Tihany Colloquim, Sept., 1966), P. Erdos and G. Katona, Eds.
- (1966) , pp. 209-214
- Katona, G.¹

17
- 4944257625
- Uber die auflosung der gleichungen auf welche man sei der untersuchung der linearen verteilung galvanischer strome gefuhrt wind
- (1847) Poggendorg's Ann. Phys. Chem. , vol.72 , pp. 497-508
- Kirhhoff, G.¹

18
- 84986996651
- [English translation, 4–8].
- (1958) IRE Trans. Circuit Theory , vol.5 CT

19
- 0001976279
- The number of simplices in a complex
- R. Bellman, University of California, Berkeley
- (1963) Mathematical Optimization Techniques , pp. 251-278
- Kruskal, J.B.¹

20
- 0003558735
- Holt, Rinehart and Winston, New York
- (1976) Combinatorial Optimization: Networks and Matroids
- Lawler, E.L.¹

21
- 0016896172
- Matrix generalizations and some theorems on trees, cycles and cocycles in graphs
- (1976) SIAM Journal on Applied Mathematics , vol.30 , pp. 143-148
- Mauer, S.B.¹

22
- 0001860685
- The shortest path through a maze
- (1959) Ann. Computation Lab. Harvard Univ. , vol.30 , pp. 285-292
- Moore, E.F.¹

23
- 85010220420
- Reliable circuits using less reliable relays
- 281, 297
- (1956) Journal of the Franklin Institute , vol.262 , pp. 191-208
- Moore, E.F.¹ Shannon, C.E.²

24
- 0002694122
- On the structure of all minimum cuts in a network and applications
- (1980) Math. Programming Study , vol.13 , pp. 8-16
- Picard, J.‐C.¹ Queyranne, M.²

25
- 84987003261
- The complexity of counting cuts and computing the probability that a graph is connected. University of Maryland at College Park, College of Business and Management Working Paper MS/S #81‐002
- (1981)
- Provan, J.S.¹ Ball, M.O.²

26
- 0000658735
- A computer scientist looks at reliability computations
- R. E. Barlow, J. B. Fussell, N. P. Singpurwalla, SIAM, Philadelphia
- (1975) Reliability and Fault Tree Analysis , pp. 133-152
- Rosenthal, A.¹

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

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

29
- 0003163054
- Cohen‐Macauley complexes
- M. Aigner, Reidel, Dordrecht
- (1977) Higher Combinatorics , pp. 51-62
- Stanley, R.P.¹

30
- 84946454140
- The dissection of equilateral triangles into equilateral triangles
- (1948) Proc. Cambridge Philos. Soc. , vol.44 , pp. 203-217
- Tutte, W.T.¹

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

32
- 0015202997
- Network reliability analysis 1
- (1972) Networks , vol.1 , pp. 279-290
- Van Slyke, R.M.¹ Frank, H.²

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