cut is NP-complete for edge weighted trees (1986)

by B Monien, I H Sudborough, Min
Venue:In Proceedings of the 10th Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 226