Guohui Yao, Daming Zhu, Hengwu Li, Shaohan Ma. A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem. Discrete Mathematics, 308(17):3951-3959, 2008. [doi]
@article{YaoZLM08,
title = {A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem},
author = {Guohui Yao and Daming Zhu and Hengwu Li and Shaohan Ma},
year = {2008},
doi = {10.1016/j.disc.2007.07.105},
url = {http://dx.doi.org/10.1016/j.disc.2007.07.105},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/YaoZLM08},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {308},
number = {17},
pages = {3951-3959},
}