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.
@inproceedings{MonienS86,
title = {Min Cut is NP-Complete for Edge Weigthed Trees},
author = {Burkhard Monien and Ivan Hal Sudborough},
year = {1986},
tags = {completeness},
researchr = {https://researchr.org/publication/MonienS86},
cites = {0},
citedby = {0},
pages = {265-274},
booktitle = {Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings},
editor = {Laurent Kott},
volume = {226},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-16761-7},
}