Login / Signup
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
Published in:
Discret. Math. (2008)
Keyphrases
</>
spanning tree
directed acyclic graph
computational complexity
dynamic programming
minimum spanning tree
objective function
undirected graph
equivalence class
times faster
probabilistic model
worst case
expectation maximization
np hard
edge disjoint