A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem.

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. 3951-3959 2008 308 Discrete Mathematics 17 http://dx.doi.org/10.1016/j.disc.2007.07.105 db/journals/dm/dm308.html#YaoZLM08