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]

Authors

Guohui Yao

This author has not been identified. Look up 'Guohui Yao' in Google

Daming Zhu

This author has not been identified. Look up 'Daming Zhu' in Google

Hengwu Li

This author has not been identified. Look up 'Hengwu Li' in Google

Shaohan Ma

This author has not been identified. Look up 'Shaohan Ma' in Google