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

A two-terminal flow network is usually defined as a directed graph, or a digraph; but there are a number of applications where it is more natural to use an undirected graph. This paper analyzes the connection between minimal path vectors and flow functions in undirected networks, which supports the development of an efficient algorithm that solves the problem of finding the set of all such vectors.

[1]  David A. Bader,et al.  Graph Algorithms , 2011, Encyclopedia of Parallel Computing.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  David W. Coit,et al.  Multi-state Two-Terminal Reliability : A Generalized Cut-Set Approach , 2004 .

[4]  David Eppstein,et al.  Randomized Speedup of the Bellman-Ford Algorithm , 2011, ANALCO.

[5]  Ravindra K. Ahuja,et al.  A capacity scaling algorithm for the constrained maximum flow problem , 1995, Networks.

[6]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[7]  K.K. Aggarwal,et al.  Capacity Consideration in Reliability Analysis of Communication Systems , 1982, IEEE Transactions on Reliability.

[8]  Ivona Bezáková,et al.  Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time , 2010, MFCS.

[9]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[10]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

[11]  W. Marsden.  I and J , 2012 .

[12]  David R. Karger,et al.  Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.

[13]  Shimon Even,et al.  Graph Algorithms , 1979 .

[14]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[15]  Anantaram. Balakrishnan,et al.  Models for planning the evolution of local telecommunication networks , 1989 .

[16]  Nikolaos Limnios,et al.  Modern Statistical and Mathematical Methods in Reliability , 2005, Series on Quality, Reliability and Engineering Statistics.

[17]  M. Mihova,et al.  On Maximal Level Minimal Path Vectors of a Two-Terminal Network , 2014 .

[18]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[19]  M. Forghani-elahabad.  A Simple Algorithm to Find All Minimal Path Vectors to Demand Level d in a Stochastic-Flow Network , 2013 .

[20]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..