Matthew Levine. Experimental Study of Minimum Cut Algorithms. M.S. dissertation, MIT, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cut Tree Algorithms - Goldberg, Tsioutsiouliklis (Correct)
....lines to a maximum flow code. Computational performance of algorithms for closely related problems, the maximum flow problem and the (global, e.g. over all s,t pairs) minimum cut problem has been studied extensively; see e.g. 1, 4, 5, 7, 18] for computational studies of the former problem and [3, 15, 16, 17, 19] for the latter. Both prob # Current address: InterTrust STAR Laboratory, 460 Oakmead Parkway, Sunnyvale, CA 94086. 1 We denote the number of vertices and edges in the input graph by n and m, respectively. lems can be solved well in practice: most problems that fit in RAM of a modern computer ....
....with gcc and optimization option O4. Our implementations are written in the same style and are derived from the HaoOrlin algorithm implementation of [3] We attempted to make all implementations as e#cient as possible. For our tests we use problem families from the previous minimum cut studies [3, 16, 17, 19], but instead of finding a minimum cut of a graph, we build a cut 2 A random choice is much less robust. tree. We omit the description of the problem families. Detailed descriptions appear in [16] We do not report on PR2 PR4 problem families because the results are very close to those for the ....
[Article contains additional citation context not shown here]
Matthew S. Levine. Experimental Study of Minimum Cut Algorithms. Technical Report MIT-LCS-TR-719, MIT Lab for Computer Science, 1997.
On MAXSAT and Minimum Cut - Geoff Pike Information (Correct)
No context found.
Matthew Levine. Experimental Study of Minimum Cut Algorithms. M.S. dissertation, MIT, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC