Min Cut is NP-Complete for Edge Weigthed Trees

Burkhard Monien, Ivan Hal Sudborough. Min Cut is NP-Complete for Edge Weigthed Trees. In Laurent Kott, editor, Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings. Volume 226 of Lecture Notes in Computer Science, pages 265-274, Springer, 1986.

Authors

Burkhard Monien

This author has not been identified. Look up 'Burkhard Monien' in Google

Ivan Hal Sudborough

This author has not been identified. Look up 'Ivan Hal Sudborough' in Google