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. Discrete Mathematics, 308(17):3951-3959, 2008. [doi]

Abstract

Abstract is missing.