An Efficient Algorithm for Enumerating all Minimal Paths of a Graph

The enumeration of all minimal paths between a terminal pair of a given graph is widely used in a lot of applications such as network reliability assessment. In this paper, we present a new and efficient algorithm to generate all minimal paths in a graph G(V, E). The algorithm proposed builds the set of minimal paths gradually, starting from the source nodes. We present two versions of our algorithm; the first version determines all feasible paths between a pair of terminals in a directed graph without cycle, and this version runs in linear time O(|V| + |E|). The second version determines all minimal paths in a general graph (directed and undirected graph). In order to show the process and the effectiveness of our method, an illustrative example is presented for each case.

[1]  Yi-Kuei Lin,et al.  A novel algorithm to evaluate the performance of stochastic transportation systems , 2010, Expert Syst. Appl..

[2]  Dirk P. Kroese,et al.  Estimating the Number of s-t Paths in a Graph , 2007, J. Graph Algorithms Appl..

[3]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[4]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

[5]  Yi-Kuei Lin,et al.  Maintenance reliability estimation for a cloud computing network with nodes failure , 2011, Expert Syst. Appl..

[6]  Hendrik Schäbe.  An improved algorithm for cutset evaluation from paths , 1995 .

[7]  Suresh Rai,et al.  On Complementation of Pathsets and Cutsets , 1980, IEEE Transactions on Reliability.

[8]  Wei-Chang Yeh.  A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

[9]  Yi-Kuei Lin,et al.  On performance evaluation of ERP systems with fuzzy mathematics , 2009, Expert Syst. Appl..

[10]  Kishor S. Trivedi,et al.  An improved algorithm for coherent-system reliability , 1998 .

[11]  Jane Nichols Hagstrom.  Note on independence of arcs in antiparallel for network flow problems , 1984, Networks.

[12]  Yi-Kuei Lin,et al.  Search for All Minimal Paths in a General Large Flow Network , 2012, IEEE Transactions on Reliability.

[13]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

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

[15]  D. R. Shier,et al.  Algorithms for Generating Minimal Cutsets by Inversion , 1985, IEEE Transactions on Reliability.

[16]  Yi-Kuei Lin,et al.  Determining the optimal double-component assignment for a stochastic computer network , 2012 .

[17]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[18]  Sieteng Soh,et al.  A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[19]  Wei-Chang Yeh.  Search for minimal paths in modified networks , 2002, Reliab. Eng. Syst. Saf..

[20]  Wei-Chang Yen.  A Simple Heuristic Algorithm for Generating All Minimal Paths , 2007, IEEE Transactions on Reliability.

[21]  N. A. Mokhles,et al.  A new technique in a cutset evaluation , 1993 .