Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees

Ronald C. Read, Robert E. Tarjan · Networks · 1975 · 260 citations

Mathematical Programming, Computational Complexity Theory, Engineering +22

Computing Network Reliability in Time Polynomial in the Number of Cuts

J. Scott Provan, Michael O. Ball · Operations Research · 1984 · 133 citations

Mathematical Programming, Engineering, Network Robustness +19

Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph

Ulrich Abel, R. Bicker · IEEE Transactions on Reliability · 1982 · 59 citations

Engineering, Planar Graph, Combinatorial Design +17

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

Sanjiv Kapoor, H. Ramesh · Algorithmica · 2000 · 47 citations

Directed Graph, Network Science, Graph Theory +11

A paradigm for listing (s, t)-cuts in graphs

J. Scott Provan, Douglas R. Shier · Algorithmica · 1996 · 46 citations

Network Science, Graph Theory, Data Science +9