Calculating bounds on reachability and connectedness in stochastic networks

This publication has 21 references indexed in Scilit:

• Maximum flow in (s,t) planar networks
  Information Processing Letters, 1981
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
  Networks, 1980
• Complexity of network reliability computations
  Networks, 1980
• On the structure of all minimum cuts in a network and applications
  Published by Springer Nature ,1980
• Cohen-Macaulay Complexes
  Published by Springer Nature ,1977
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
  SIAM Journal on Applied Mathematics, 1976
• Network reliability analysis: Part I
  Networks, 1971
• Reliable circuits using less reliable relays
  Journal of the Franklin Institute, 1956
• The dissection of equilateral triangles into equilateral triangles
  Mathematical Proceedings of the Cambridge Philosophical Society, 1948
• Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
  Annalen der Physik, 1847