Min Cut is NP-Complete for Edge Weighted Treees

Burkhard Monien, Ivan Hal Sudborough. Min Cut is NP-Complete for Edge Weighted Treees. Theoretical Computer Science, 58:209-229, 1988.

Abstract

Abstract is missing.