Maximal Level Minimal Path Vectors of a Two-Terminal Undirected Network

IEEE Transactions on Reliability

Volumn 65, Issue 1, 2016, Pages 282-290

  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 path vector; two terminal flow network; undirected network

Indexed keywords

ALGORITHMS; FLOW GRAPHS;

FLOW FUNCTION; MINIMAL PATH VECTORS; TWO TERMINALS; UNDIRECTED GRAPH; UNDIRECTED NETWORK;

DIRECTED GRAPHS;

EID: 84927750151     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2015.2420042     Document Type: Article

References (22)

1. A. Balakrishnan, "Models for planning the evolution of local telecommunication networks, " Alfred P. Sloan School of Management, Massachusetts Inst. Technol., 1989.
2. K. Aggarwal, Y. Chopra, J. Bajwa, "Capacity consideration in reliability analysis of communication systems, " IEEE Trans. Rel., vol. 31, no. 2, pp. 177-180, 1982.
3. R. K. Ahuja and J. B. Orlin, "A capacity scaling algorithm for the constrained maximum flow problem, " Networks, vol. 25, pp. 89-98, 1993.
4. M. J. Bannister and D. Eppstein, "Randomized speedup of the Bellman-Ford algorithm, " in Proc. Analytic Algorithmics and Combinatorics (ANALCO12), Kyoto, Japan, 2012, pp. 41-47.
5. I. Bezakova and A. J. Friedlander, "Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time, " in Proc. 35th Int. Symp., MFCS 2010, Brno, Czech Republic, Aug. 2010.
6. H. T. Cormen, E. C. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 3rd ed. Cambridge, MA, USA: MIT Press, 2009.0
7. J. Erickson, "Algorithms, " Univ. Illinois at Urbana-Champaign, 2009.
8. M. Forghani-Elahabadi and N. Mahdavi-Amiri, "A simple algorithm to find all minimal path vectors to demand level d in a stochastic-flow network, " in Proc. 5th Iranian Conf. Applied Mathematics, Sep. 2013, Bu-Ali Sina Univ.
9. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ, USA: Princeton Univ. Press, 1962.
10. C. C. Jane, J. S. Lin, J. Yuan, "Reliability evaluation of a limited-flow network in terms of minimal cut sets, " IEEE Trans. Rel., vol. 42, pp. 354-361, 1993.
11. A. Kamil, "Graph algorithms, " CS61B Univ. California. Berkeley, CA, USA, 2003.
12. D. R. Karger and M. S. Levine, "Finding maximum flows in undirected graphs seems easier than bipartite matching, " in Proc. 30th Annu. ACM Symp. Theory of Computing, 1998, pp. 69-78.
13. J. S. Lin, C. C. Jane, J. Yuan, "On reliability evaluation of a capacitated-flow network in terms of minimal path sets, " Networks, vol. 3, pp. 131-138, 1995.
14. Y. K. Lin, "A simple algorithm for reliability evaluation of a stochastic-flow network with node failure, " Comput. Oper. Res., vol. 28, pp. 1277-1285, 2001.
15. M. Mihova and N. Maksimova, "Estimation of minimal path vectors of multi state two terminal networks with cycles control, ". MathematicaBalkanica, vol. 25, pp. 437-447, 2011, Fasc4, ISSN 0205-3217.
16. M. Mihova, N. Stojkovikj, M. Jovanov, E. Stankov, "On maximal level minimal path vectors of a two-terminal network, " Int. J. Olympiads Informat., IOI, vol. 8, pp. 133-144, 2014.
17. J. C. Picard and Q. Maurice, "On the structure of all minimum cuts in a network and application, " Math. Program. Study, vol. 13, pp. 8-16, 1980.
18. J. S. Provan and M. O. Balls, "The complexity of counting cuts and of computing the probability that a graph is connected, " SIAMJ. Comput., pp. 777-788, 1983.
19. J. E. Ramirez-Marquez and D. Coit, "Alternative approach for analyzing multistate network reliability, " in Proc. Industrial Engineering Research Conf. (IERC), Portland, OR, USA, May 2003.
20. J. E. Ramirez-Marquez, D. Coit, M. Tortorella, "Multi-state twoterminal reliability: A generalized cut-set approach, " Rutgers Univ. IE Working Paper, 03-135, 2003.
21. J. Schroeder, P. A. Guedes, P. D. Elias, Jr., "Computing the minimum cut and maximum flow of undirected graphs, " RelatórioTécnico RT-DINF 003/2004. Curitiba, PR, USA, 2004.
22. A. Wilson, N. Limnios, S. Keller-Mc-Nulty, Y. Armijo, Modern Statistical and Mathematical Methods in Reliability, ser. Quality, Reliability, Engineering Statistics. Singapore: World Scientific, 2005, vol. 10.