On maximal level minimal path vectors of a two-terminal network

Olympiads in Informatics

Volumn 8, Issue , 2014, Pages 133-144

  Mihova, Marija ^a   Stojkovikj, Natasha ^b   Jovanov, Mile ^a   Stankov, Emil ^a  

^a SS CYRIL AND METHODIUS UNIVERSITY   (Macedonia)

^b University Goce Delcev   (Macedonia)

Author keywords

Minimal cut vector; Minimal path vector; Two terminal flow network

Indexed keywords

DISCRETE SETS; FLOW NETWORK; MINIMAL CUT VECTOR; MINIMAL CUTS; MINIMAL PATH; MINIMAL PATH VECTORS; PATH CUTS; TERMINAL FLOW; TWO TERMINALS; TWO-TERMINAL FLOW NETWORK;

VECTORS;

EID: 84921909731     PISSN: 18227732     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Aggarwal, K., Chopra, Y., Bajwa, J. (1982). Capacity consideration in reliability analysis of communication systems. IEEE Transactions on Reliability, 31(2), 177-180.
2. Ahuja, R. K., Orlin, J. B. (1993). A capacity scaling algorithm for the constrained maximum flow problem. Networks, 25, 89-98.
3. Bezakova, I., Friedlander, A. J. (2010). Counting minimum (s, t)-Cuts in weighted planar graphs in polynomial time. In: Proceedings of 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010.
4. Cormen, H. T., Leiserson, E. C., Rivest, R. L., Stein, C. (2009). Introduction to Algorithms, 3rd edition. The MIT Press
5. Erickson, J. (2009). Algorithms. University of Illinois at Urbana-Champaign.
6. Forghani-elahabad, M., Mahdavi-Amiri, N. (2013). A simple algorithm to find all minimal path vectors to demand level d in a stochastic-flow network. In: 5-th Iranian Conference on Applied Mathematics, September 2-4, 2013 Bu-Ali Sina University.
7. Jane, C. C., Lin, J. S., Yuan, J. (1993). Reliability evaluation of a limited-flow network in terms of minimal cut sets. IEEE Transactions on Reliability, 42, 354-361.
8. Kamil, A. (2003). "Graph Algorithms", CS61B. University of California, Berkeley
9. Lin, J. S., Jane C. C., Yuan, J. (1995). On reliability evaluation of a capacitated - flow network in terms of minimal path sets. Networks, 3, 131-138.
10. Lin, Y. K. (2001). A simple algorithm for reliability evaluation of a stochastic - flow network with node failure. Computers and Operations Research, 28, 1277-1285.
11. Mihova, M., Maksimova, N. (2011). Estimation of minimal path vectors of multi state two terminal networks with cycles control. Mathematica Balkanica, 25(4), 437-447.
12. Picard, J. C., Maurice, Q. (1980). On the structure of all minimum cuts in a network and application. Mathematical Programming Study, 13, 8-16.
13. Provan, J. S., Balls, M. O. (1983). The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, 12(4), 777-788.
14. Ramirez-Marquez, J. E, Coit, D. (2003). Alternative approach for analyzing multistate network reliability. In: Proceedings of the Industrial Engineering Research Conference (IERC), Portland, OR, May 2003.
15. Ramirez-Marquez, J. E., Coit, D., Tortorella, M., (2003). Multi-statetwo-terminal reliability: a generalized cut-set approach. Rutgers University IE Working Paper, 03-135.
16. Wilson, A., Limnios, N., Keller-McNulty, S., Armijo, Y. (2005). Modern Statistical and Mathematical Methods in Reliability. World Scientific Publishing, Series on Quality, Reliability, and Engineering Statistics, vol. 10.