A Paradigm for Listing (s, t)-Cuts in Graphs

Algorithmica (New York)

Volumn 15, Issue 4, 1996, Pages 351-372

  Provan, J S ^a   Shier, D R ^b  

^a University of North Carolina at Chapel Hill   (United States)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Algorithm; Cut; Enumeration; Generation; Ideal

Indexed keywords

EID: 0000402268     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01961544     Document Type: Article

References (32)

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 in LR(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, Computing K-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.
6. M. Bellmore and P. A. Jensen, An implicit enumeration scheme for proper cut generation, Technometrics 12 (1970), 775-788.
7. C. J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, New York, 1987.
8. L. Fratta and U. G. Montanari, A Boolean algebra method for computing the terminal reliability in a communication network, IEEE Trans. Circuit Theory 20 (1973), 203-211.
9. M. L. Gardner, An algorithm to aid in the design of large scale networks, Large Scale Systems 8 (1985), 147-156.
10. R. E. Gomory and T. C. Hu, Multi-terminal network flows, SIAM J. Appl. Math. 9 (1961), 551-570.
11. D. Gusfield, Very simple methods for all pairs network flow analysis, SIAM J. Comput. 19 (1990), 143-155.
12. D. Gusfield and D. Naor, Extracting maximal information about sets of minimum cuts, Algorithmica 10 (1993), 64-89.
13. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1971.
14. D. Harel, A linear time algorithm for finding dominators in flow graphs and related problems (extended abstract), Proc. 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 185-194.
15. R. Hassin, Solution bases of multi-terminal cut problems, Math. Oper. Res. 13 (1988), 535-542.
16. P. A. Jensen and M. Bellmore, An algorithm to determine the reliability of a complex system, IEEE Trans. Reliability 18 (1969), 169-174.
17. A. Kanevsky, Finding all minimum size separating vertex sets in a graph, Networks 23 (1993), 533-541.
18. V. G. Kulkarni and J. S. Provan, An improved implementation of conditional Monte Carlo estimation of path lengths in stochastic networks, Oper. Res. 33 (1985), 1389-1393.
19. E. L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math. 2 (1978), 75-90.
20. G. L. Nemhauser and L. E. Trotter, Vertex packings: structural properties and algorithms, Math. Programming 8 (1975), 232-248.
21. J. C. Picard and M. Queyranne, On the structure of all minimum cuts in a network and applications, Math. Programming Stud. 13 (1980), 8-16.
22. J. C. Picard and M. Queyranne, Selected applications of minimum cuts in networks, INFOR 20 (1982), 394-422.
23. J. S. Provan, Efficient enumeration of the vertices of polyhedra associated with network LP's, Math. Programming 63 (1994), 47-64.
24. J. S. Provan and V. G. Kulkarni, Exact cuts in networks, Networks 19 (1989), 281-289.
25. A. Ramanathan and C. J. Colbourn, Counting almost minimum cutsets with reliability applications, Math. Programming 39 (1987), 253-261.
26. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5 (1975), 237-252.
27. D. R. Shier, Network Reliability and Algebraic Structures, Clarendon Press, Oxford, 1991.
28. C. E. Sigal, A. A. B. Pritsker, and J. J. Solberg, The use of cutsets in Monte Carlo analysis of stochastic networks, Math. Comput. Simulation 21 (1979), 376-384.
29. G. Steiner, An algorithm to generate the ideals of a partial order, Oper. Res. Lett. 5 (1986), 317-320.
30. R. E. Tarjan, Finding dominators in directed graphs, SIAM J. Comput. 3 (1974), 62-89.
31. S. Tsukiyama, I. Shirakawa, H. Ozaki, and H. Ariyoshi, An algorithm to enumerate all cutsets of a graph in linear time per cutset, J. Assoc. Comput. Mach. 27 (1980), 619-632.
32. O. Wing and W. H. Kim, The path matrix and switching functions, J. Franklin Inst. 268 (1959), 251-269.