The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May/June (2009 vol.11)
pp: 74-79
Isabel Beichl , National Institute of Standards and Technology
Francis Sullivan , Center for Computing Sciences
ABSTRACT
This issue marks the return of the Computing Prescriptions department; here, the authors describe an algorithm for finding minimum cutsets in connected graphs.
INDEX TERMS
computation, cutset, edges, graphs, computing prescriptions
CITATION
Isabel Beichl, Francis Sullivan, "Cut It Out!", Computing in Science & Engineering, vol.11, no. 3, pp. 74-79, May/June 2009, doi:10.1109/MCSE.2009.51
REFERENCES
1. D.R. Karger and C. Stein, "An O(n2) Algorithm for Minimum Cuts," Proc. 25th Ann. Symp. Theory of Computing, ACM Press, 1993, pp. 757–765.
2. I. Beichl and F. Sullivan, "In Order to Form a More Perfect Union," Computing in Science &Eng., vol. 3, no. 2, 2001, pp. 60–64.
11 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool