Description: Each arc of a binary-state network has good/bad states. The system reliability, the probability
that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An
MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is
different from the so-called minimum path. The latter is a path with minimum cost.
To Search:
- [unreliable] - This paper addresses a stochastic-#ow ne
- [LINEbuffer] - GIS, one of the core algorithm, line buf
- [C300] - Some commonly used C-language program, w
File list (Check if you may need any files):
Download