1. U. Abel and R. Bicker, Determination of all minimal cut-sets between a vertex pair in an undirected graph,IEEE Trans. Reliability 31 (1982), 167–171.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. M. R. Anderson, Null nonterminal insertion inLR(k) grammars, Technical Report CSE-TR-49-90, Department of Electrical Engineering and Computer Science, University of Michigan, 1990.
4. M. O. Ball and J. S. Provan, Calculating bounds on reachability and connectedness in stochastic networks,Networks 13 (1983), 253–278.
5. M. O. Ball and J. S. Provan, ComputingK-terminal reliability in time polynomial in the number of (s, K)-quasicuts,Proc. Fourth Army Conference on Applied Mathematics and Computing, 1987, pp. 901–907.