A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree

K. Viswanathan Iyer, S. Prasanna. A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree. Inf. Process. Lett., 109(11):560-562, 2009. [doi]

@article{IyerP09,
  title = {A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree},
  author = {K. Viswanathan Iyer and S. Prasanna},
  year = {2009},
  doi = {10.1016/j.ipl.2009.01.023},
  url = {http://dx.doi.org/10.1016/j.ipl.2009.01.023},
  researchr = {https://researchr.org/publication/IyerP09},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {109},
  number = {11},
  pages = {560-562},
}