• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Guohui YaoDaming ZhuHengwu LiShaohan Ma
Published in: Discret. Math. (2008)
Keyphrases