Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees

Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner. Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. In 23rd Annual Symposium on Foundations of Computer Science, 3-5 November 1982, Chicago, Illinois, USA. pages 262-271, IEEE, Chicago, Illinois, 1982.

@inproceedings{ChungMST82,
  title = {Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees},
  author = {Moon-Jung Chung and Fillia Makedon and Ivan Hal Sudborough and Jonathan S. Turner},
  year = {1982},
  researchr = {https://researchr.org/publication/ChungMST82},
  cites = {0},
  citedby = {0},
  pages = {262-271},
  booktitle = {23rd Annual Symposium on Foundations of Computer Science, 3-5 November 1982, Chicago, Illinois, USA},
  address = {Chicago, Illinois},
  publisher = {IEEE},
}