A paradigm for listing (s, t)-cuts in graphs
Authors:
- 1 April 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 15 (4) , 351-372
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Finding all minimum‐size separating vertex sets in a graphNetworks, 1993
- Extracting maximal information about sets of minimum cutsAlgorithmica, 1993
- Exact cuts in networksNetworks, 1989
- An algorithm to generate the ideals of a partial orderOperations Research Letters, 1986
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, 1983
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per CutsetJournal of the ACM, 1980
- On the structure of all minimum cuts in a network and applications1980
- The use of cutsets in Monte Carlo analysis of stochastic networksMathematics and Computers in Simulation, 1979
- An Implicit Enumeration Scheme for Proper Cut GenerationTechnometrics, 1970
- The path matrix and switching functionsJournal of the Franklin Institute, 1959