1. The complexity of the multiway cuts;Dalhaus;SIAM J. Comput.,1994
2. O. Goldschmidt, Deterministic and Probabilistic Aspects of the k-Way Cut Problem, Ph.D. Dissertation, U.C. Berkeley, 1988.
3. Polynomial algorithm for the k-way cut problem;Goldschmidt,1988
4. O. Goldschmidt, and, D. S. Hochbaum, A Polynomial Algorithm for the k-Way Cut Problem for Fixed k, Unpublished paper, 1991.
5. Asymptotically optimal linear algorithm for the minimum k-way cut in a random graph;Goldschmidt;SIAM J. Discrete Math.,1990